Pagini recente » Cod sursa (job #1771486) | Cod sursa (job #2206524) | Cod sursa (job #805148) | Cod sursa (job #2571661) | Cod sursa (job #2368820)
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#define NMAX 100005
#define mod 1000000007LL
using namespace std;
ifstream fi("galagie.in");
ofstream fo("galagie.out");
int N;
long long elevi[NMAX];
long long sp[NMAX];
int main()
{
fi >> N;
for(int i = 1; i <= N; ++i)
fi >> elevi[i];
sort(elevi + 1, elevi + N + 1);
for(int i = 1; i <= N; ++i)
sp[i] = (sp[i-1] + elevi[i]) % mod;
long long sum = 0;
for(int i = 1; i <= N; ++i)
sum = (sum + (elevi[i] * (i - 1)) % mod - sp[i - 1] + mod ) % mod;
fo << (sum * 2) % mod;
}