Submission #4058

#TimeUsernameProblemLanguageResultExecution timeMemory
4058shinhj88King of penalty (kriii1_K)C++98
0 / 1
0 ms1236 KiB
#include <cstdio> #include <vector> #include <algorithm> using namespace std; long long int P,N; vector<long long int> data; void input() { scanf("%lld%lld",&P,&N); data.resize(N+1); for(int i=0;i<N;i++) { scanf("%lld",&data[i]); } data[N]=100000001; sort(data.begin(),data.end()); } void process() { long long int Sum=0,ans=0,i; for(i=0;i<N;i++) { if(Sum+data[i]>=P) { break; } Sum+=data[i]; } ans=(P-1-Sum)+data[i-1]; for(int j=i-2;j>=0;j--) { ans+=(ans+data[j]); } printf("%d %lld",i,ans); return; } int main() { input(); process(); }
#Verdict Execution timeMemoryGrader output
Fetching results...