# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
4053 | 2013-08-31T16:07:30 Z | shinhj88 | King of penalty (kriii1_K) | C++ | 0 ms | 0 KB |
#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() { P--; long long int ans=0,sum=0; for(int i=0;i<=N;i++) { if(P-data[i]<=0) { printf("%d %lld\n",i,ans); break; } P-=data[i]; ans+=P } } int main() { input(); process(); }