#include <bits/stdc++.h>
using namespace std;
//#define int long long
const int NMAX = 100000;
int heure[NMAX];
int diff[NMAX];
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int nbGuest; int all;
cin >> nbGuest >> all;
for(int i = 0; i < nbGuest; i++)
{
cin >> heure[i];
if(i > 0)
{
diff[i-1] = heure[i]-heure[i-1]-1;
}
}
sort(diff, diff+nbGuest-1);
int nbAll = nbGuest;
/// cout << nbAll << endl;
for(int i = 0; i < (nbGuest-all); i++)
{
nbAll+=diff[i];
}
cout << nbAll;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
468 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
464 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
468 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
464 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
344 KB |
Output is correct |
11 |
Correct |
1 ms |
348 KB |
Output is correct |
12 |
Correct |
1 ms |
348 KB |
Output is correct |
13 |
Correct |
1 ms |
484 KB |
Output is correct |
14 |
Correct |
1 ms |
520 KB |
Output is correct |
15 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
468 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
464 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
344 KB |
Output is correct |
11 |
Correct |
1 ms |
348 KB |
Output is correct |
12 |
Correct |
1 ms |
348 KB |
Output is correct |
13 |
Correct |
1 ms |
484 KB |
Output is correct |
14 |
Correct |
1 ms |
520 KB |
Output is correct |
15 |
Correct |
1 ms |
348 KB |
Output is correct |
16 |
Correct |
13 ms |
2140 KB |
Output is correct |
17 |
Correct |
13 ms |
2140 KB |
Output is correct |
18 |
Correct |
13 ms |
2140 KB |
Output is correct |
19 |
Correct |
13 ms |
2140 KB |
Output is correct |
20 |
Correct |
13 ms |
2140 KB |
Output is correct |
21 |
Correct |
13 ms |
2140 KB |
Output is correct |
22 |
Correct |
13 ms |
2204 KB |
Output is correct |
23 |
Correct |
13 ms |
2140 KB |
Output is correct |
24 |
Correct |
13 ms |
2208 KB |
Output is correct |