# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
3452 | 2013-08-31T05:52:52 Z | imsifile | King of penalty (kriii1_K) | C++ | 0 ms | 2824 KB |
#include<stdio.h> #include<algorithm> using namespace std; long long p, n, ba[111111], cnt, sum[111111], hh, dap, i, j; int main(){ scanf("%lld%lld", &p,&n); for(i=1; i<=n; i++)scanf("%lld", &ba[i]), sum[i]=sum[i-1]+ba[i]; sort(ba+1, ba+n+1); for(i=1; i<=n; i++){ if(sum[i]>=p)break; cnt++; } hh=p-1; for(i=1; i<=cnt; i++)dap+=hh, hh-=ba[i]; printf("%lld %lld", cnt, dap); return 0; }
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 2824 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |