Submission #7325

#TimeUsernameProblemLanguageResultExecution timeMemory
7325sinceww77카드 (GA8_card)C++98
100 / 100
0 ms1476 KiB
#include <stdio.h> #include <algorithm> using namespace std; struct ab { int m; }data[100000]; int aa(ab c,ab d) { if(c.m<d.m) return 1; return 0; } int main() { int i,j,n,tot=0; scanf("%d ",&n); for(i=1;i<=n;i++) { scanf("%d ",&data[i].m); } std::sort(data+1,data+1+n,aa); for(i=1;i<n;i++) { tot+=data[i].m; } printf("%d",tot); 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...