Submission #9485

#TimeUsernameProblemLanguageResultExecution timeMemory
9485yukarikoUniting (kriii2_U)C11
0 / 4
0 ms1356 KiB
#include <stdio.h> //#include <windows.h> #include <stdlib.h> #include <string.h> int compare(const void *a , const void *b); int main() { int N; int s[100001]; long long cnt; long long sum; int i,j; cnt = 1; sum = 0; scanf("%d",&N); for(i=0;i<N;i++) scanf("%d",s+i); for(i=N;i>=2;i--) { cnt *= i*(i-1); } qsort(s , N , sizeof(s[0]) , compare); for(i=0;i<N-1;i++) { sum += s[i]*s[i+1]; s[i+1] += s[i]; } cnt = cnt%1000000007; printf("%lld\n",sum); printf("%lld\n",cnt); //system("pause"); return 0; } int compare(const void *a , const void *b){ return strcmp( (char*)a , (char*)b ); }
#Verdict Execution timeMemoryGrader output
Fetching results...