백준/백준-C++

11399번: ATM

Beabletoet 2017. 6. 13. 19:40

#include<cstdio>

#include<algorithm>

int main()

{

int n, p[1000], sum;

scanf("%d", &n);

for (int i = 0; i < n; ++i)

scanf("%d", &p[i]);

std::sort(&p[0], &p[n]);

sum = p[0];

for (int i = 1; i < n; sum += p[i++])

p[i] += p[i - 1];

printf("%d", sum);

}