[BJ] 11399 ATM (그리디)

문제읽기가 너무 난해해서 굉장히 쉬움에도 오래걸렸다;

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;

int n;
vector<int> v;
int sum = 0;
int ret = 0;

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

	cin >> n;

	for (int i = 0; i < n; ++i)
	{
		int a; 
		cin >> a;
		v.push_back(a);
	}

	sort(v.begin(), v.end());

	for (int i = 0; i < n; ++i)
	{
		sum += v[i];
		ret += sum;
	}

	cout << ret;

	return 0;
}