Submission #4182

#TimeUsernameProblemLanguageResultExecution timeMemory
4182hsswillKing of penalty (kriii1_K)C++98
0 / 1
24 ms1476 KiB
#include<stdio.h> #include<algorithm> using std::sort; int data[100011]; int main(void) { int a, i, sum, n, t = 0, result, r = 0; scanf("%d %d",&a,&n); for(i = 0; i < n; i++) scanf("%d",&data[i]); sort( data, data+n ); sum = 0; for(i = 0; i < n; i++) { r = sum; sum += data[i]; if( sum >= a ) break; } if( sum < a ) r = sum; r = a-r-1; result = i; t = 0; sum = r; for(i = result-1; i >= 0; i--) { sum += data[i]; t += sum; } printf("%d %d",result,t); }
#Verdict Execution timeMemoryGrader output
Fetching results...