#include <iostream>
#include <algorithm>
#include <stdio.h>
using namespace std;
/*typedef struct{
int x, y, n, nn;
}tree;
tree h[101];
int hx[101], hy[101];
bool cmp(tree a, tree b){ return a.n>b.n; }*/
bool cmpx(int a, int b){ return a<b; }
long long h[100005], s[100005], sum;
int main ()
{
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int a, b, c;
int i, j, k, t;
scanf("%d %d", &a, &b);
for(i=0;i<b;i++){scanf("%lld", &h[i]);}
s[0]=h[0];
sort(h,h+b,cmpx);
for(i=1;i<b;i++){s[i]=s[i-1]+h[i];}
for(i=0;i<b;i++)
{
if(s[i]>a-1){break;}
sum=sum+(a-1-s[i])+h[i]; if(i==b-1){i++; break;}
} //if(i==b){i--;}
printf("%d %lld", i, sum);
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
3240 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
3240 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
