贪心 Codeforces Round #263 (Div. 2) C. Appleman and Toastman

题目传送门

 /*
     贪心：每次把一个丢掉，选择最小的。累加求和，重复n-1次
 */
 /************************************************
 Author        :Running_Time
 Created Time  :2015-8-1 13:20:01
 File Name     :A.cpp
 *************************************************/
 #include <cstdio>
 #include <algorithm>
 #include <iostream>
 #include <sstream>
 #include <cstring>
 #include <cmath>
 #include <string>
 #include <vector>
 #include <queue>
 #include <deque>
 #include <stack>
 #include <list>
 #include <map>
 #include <set>
 #include <bitset>
 #include <cstdlib>
 #include <ctime>
 using namespace std;
 typedef long long ll;
 const int MAXN = 3e5 + ;
 const int INF = 0x3f3f3f3f;
 const int MOD = 1e9 + ;
 int a[MAXN];
 int main(void)    {       //Codeforces Round #263 (Div. 2) C. Appleman and Toastman
     int n;  ll sum, ans;
     while (scanf ("%d", &n) == )   {
         sum = ;
         for (int i=; i<=n; ++i)    {
             scanf ("%d", &a[i]);    sum += a[i];
         }
         if (n == ) {
             printf ("%d\n", a[]);  continue;
         }
         sort (a+, a++n);
         ans = sum;
         for (int i=; i<n; ++i)    {
             ans += sum; sum -= a[i];
         }
         printf ("%I64d\n", ans);
     }
     return ;
 }