Submission #997872

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<cmath>
#include<vector>
#include<queue>
#include<map>
#include<algorithm>
#include<complex>
#include<string>
#include<cstring>
using namespace std;
#define rep2(x,from,to) for(int x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)
#define INF 100000000
#define debug(x) cout<<#x<<": "<<x<<endl

#define all(x) x.begin(),x.end()
typedef pair<int,int> P;
typedef pair<int,P> PP;
int n,m,k;
int a[100005];
int ans;
int main()
{
	cin>>n>>m>>k;
	rep(i,n)
	{
		cin>>a[i];
	}
	sort(a,a+n);
	rep(i,n)
	{
		ans+=((i+1)*a[i]);
	}
	cout<<ans<<endl;
	return 0;
}

Submission Info

Judge Result