# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
3491 | BalloonCollector | King of penalty (kriii1_K) | C++98 | 24 ms | 1476 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <algorithm>
using namespace std;
int p,n,a[100001],s,re;
long long pn,sum;
int main(void){
scanf("%d %d",&p,&n);
for(int i=0; i<n; i++)
scanf("%d",&a[i]);
sort(a,a+n);
for(int i=0; i<n; i++){
if(s+a[i]>=p){
re=i;
sum=(long long)(p-s-1);
for(int j=i-1; j>=0; j--){
pn+=sum+a[j];
sum+=a[j];
}
break;
}
else s+=a[i];
}
printf("%d %lld",re,pn);
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |