Cod sursa(job #2272755)
Utilizator | Tony Barosanu Junior TOnYbArOsAnU | Data | 30 octombrie 2018 17:09:34 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
#define Nmax 100001
using namespace std;
ifstream in("galagie.in");
ofstream out("galagie.out");
int n,a[Nmax];
long long l,sp[Nmax];
int main()
{
in>>n;
for(int i=1;i<=n;i++)
{
in>>a[i];
}
sort(a+1,a+n+1);
for(int i=1;i<=n;i++)
{
sp[i]=sp[i-1]+a[i];
}
for(int i=n;i>=2;i--)
{
l+=a[i]*(i-1)*1LL-sp[i-1];
}
l*=2*1LL;
out<<l;
return 0;
}