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

最新推荐文章于 2022-07-13 02:01:45 发布

QQQUQ

最新推荐文章于 2022-07-13 02:01:45 发布

阅读量452

点赞数

分类专栏： Implementation

本文链接：https://blog.csdn.net/wjzdmr/article/details/38864989

版权

Implementation 专栏收录该内容

14 篇文章 0 订阅

订阅专栏

几经测试可以发现，当我们把数组升序排列后，下标从0算起最小的数+2(i + 2)次，第二小的数+3(i + 2)次...第二大数+(i + 2 = n - 2 + 2 = n)次注意最大数同时与第二大数被舍弃也加了n次，遍历后sum - arr[n - 1]即为答案.注意数据类型用long long.

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <deque>
#include <queue>
#include <cctype>
#include <map>
#include <set>
#include <bitset>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdlib>
#include <ctime>
#include <cassert>
#include <limits>
#include <fstream>

using namespace std;

#define mem(A, X) memset(A, X, sizeof A)
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define all(x) x.begin(), x.end()
#define sz(x) (int)((x).size())
#define rep(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#define Rep(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define min3(a,b,c) min(a,min(b,c))
#define max3(a,b,c) max(a,max(b,c))
#define dbg(a) cout << a << endl;
#define fi first
#define se second
typedef long long int64;
int gcd(const int64 &a, const int64 &b) {return b == 0 ? a : gcd(b, a % b);}
int64 int64pow(int64 a, int64 b){if(b == 0) return 1;int64 t = int64pow(a, b / 2);if(b % 2) return t * t * a;return t * t;}
const int inf = 1 << 30;
const double eps = 1e-8;
const double pi = acos(-1.0);
const int MAX_N = 300000 + 5;

int64 arr[MAX_N], sum, n;

void solve()
{
    sum = 0;
    rep(i, 0, n) scanf("%I64d", &arr[i]);
    sort(arr, arr + n);
    rep(i, 0, n) {
        sum += arr[i] * (i + 2);
    }
    sum -= arr[n - 1];
    cout << sum << endl;
}
int main()
{
    while (cin >> n) {
        solve();
    }
    return 0;
}