Submission #7104

#TimeUsernameProblemLanguageResultExecution timeMemory
7104baneling100지우개 (GA4_eraser)C++98
0 / 100
12 ms3040 KiB
#include <stdio.h> int N, M, A[100001]; long long B[100001], C[100001], Ans; void input(void) { int i, temp; scanf("%d",&N); for(i=1 ; i<=N ; i++) { scanf("%d",&temp); A[temp]++; if(M<temp) M=temp; } } void process(void) { int i; long long sum=0; for(i=M ; i>=2 ; i--) { sum+=(long long)A[i]*i; B[i-1]=sum*A[i-1]*(i-1); } sum=0; for(i=M-1 ; i>=2 ; i--) { sum+=B[i]; C[i-1]=sum*A[i-1]*(i-1); } for(i=1 ; i<=M-2 ; i++) Ans+=C[i]; } void output(void) { printf("%lld",Ans); } int main(void) { input(); process(); output(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...