Submission #3572

#TimeUsernameProblemLanguageResultExecution timeMemory
3572BalloonCollectorKing of penalty (kriii1_K)C++98
1 / 1
24 ms1868 KiB
#include <cstdio> #include <algorithm> using namespace std; int n,re; long long a[100001],s; long long p,pn,sum; int main(void){ scanf("%lld %d",&p,&n); for(int i=0; i<n; i++) scanf("%d",&a[i]); sort(a,a+n); re = -1; for(int i=0; i<n; i++){ if(s+a[i]>=p){ re=i; break; } else s+=a[i]; } if( re == -1 ) re = n; sum=(long long)(p-s-1); for(int j=re-1; j>=0; j--){ pn+=sum+a[j]; sum+=a[j]; } printf("%d %lld",re,pn); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...