#include<cstdio>
#include<algorithm>
int a[100000];
int main()
{
int can=0;
long long res=0;
int i,p,n;
scanf("%d%d",&p,&n);
for(i=0;i<n;i++)scanf("%d",&a[i]);
std::sort(a,a+n);
while(can<n&&p>a[can])
{
res+=p-1;
p-=a[can];
can++;
}
printf("%d %lld\n",can,res);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1476 KB |
Output is correct |
2 |
Correct |
0 ms |
1476 KB |
Output is correct |
3 |
Correct |
0 ms |
1476 KB |
Output is correct |
4 |
Correct |
4 ms |
1476 KB |
Output is correct |
5 |
Correct |
0 ms |
1476 KB |
Output is correct |
6 |
Correct |
4 ms |
1476 KB |
Output is correct |
7 |
Correct |
8 ms |
1476 KB |
Output is correct |
8 |
Correct |
4 ms |
1476 KB |
Output is correct |
9 |
Correct |
24 ms |
1476 KB |
Output is correct |
10 |
Correct |
24 ms |
1476 KB |
Output is correct |
11 |
Correct |
12 ms |
1476 KB |
Output is correct |
12 |
Correct |
12 ms |
1476 KB |
Output is correct |
13 |
Correct |
0 ms |
1476 KB |
Output is correct |
14 |
Correct |
0 ms |
1476 KB |
Output is correct |
15 |
Correct |
4 ms |
1476 KB |
Output is correct |