#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,P);
return;
}
ans+=P;
P-=data[i];
}
}
int main()
{
input();
process();
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
1236 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
