Submission #9622

#TimeUsernameProblemLanguageResultExecution timeMemory
9622kkjjkkUniting (kriii2_U)C++98
0 / 4
0 ms2456 KiB
#include <algorithm> #include <iostream> #include <cstdio> using namespace std; long long h[100005]; int main() { int n; scanf("%d", &n); for(int i = 0; i < n; i++) scanf("%lld", &h[i]); if(n == 1) printf("0\n"); else if(n == 2) { printf("%lld\n", h[0] * h[1]); } else { sort(h, h + n); long long a = h[0] + h[1]; long long b = h[0] * h[1]; long long c, d, m = 1000000007; for(int i = 2; i < n; i++) { c = a + h[i]; d = a * h[i]; //d %= ; a = c; b = ((b % m) + (d % m)) % m; b %= 1000000007; } printf("%lld\n", b); } printf("-1"); }
#Verdict Execution timeMemoryGrader output
Fetching results...