#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
int n,k,pop,akt;
cin >> n >> k;
vector<int> odl;
cin >> pop >> akt;
odl.push_back(akt-pop-1);
for (int i=0; i<n-2; i++){
pop=akt;
cin >> akt;
odl.push_back(akt-pop-1);
}
sort(odl.begin(),odl.end());
reverse(odl.begin(),odl.end());
//for (int i:odl) cout << i << ' ';
k=n-k;
int wyn=n;
while (k-- or (odl.size() and odl[odl.size()]<0)){
wyn+=odl[odl.size()-1];
odl.pop_back();
}
cout << wyn;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Correct |
1 ms |
336 KB |
Output is correct |
3 |
Correct |
1 ms |
336 KB |
Output is correct |
4 |
Correct |
1 ms |
336 KB |
Output is correct |
5 |
Correct |
1 ms |
336 KB |
Output is correct |
6 |
Correct |
1 ms |
336 KB |
Output is correct |
7 |
Correct |
1 ms |
336 KB |
Output is correct |
8 |
Correct |
1 ms |
336 KB |
Output is correct |
9 |
Correct |
1 ms |
336 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Correct |
1 ms |
336 KB |
Output is correct |
3 |
Correct |
1 ms |
336 KB |
Output is correct |
4 |
Correct |
1 ms |
336 KB |
Output is correct |
5 |
Correct |
1 ms |
336 KB |
Output is correct |
6 |
Correct |
1 ms |
336 KB |
Output is correct |
7 |
Correct |
1 ms |
336 KB |
Output is correct |
8 |
Correct |
1 ms |
336 KB |
Output is correct |
9 |
Correct |
1 ms |
336 KB |
Output is correct |
10 |
Correct |
2 ms |
336 KB |
Output is correct |
11 |
Correct |
2 ms |
336 KB |
Output is correct |
12 |
Correct |
2 ms |
336 KB |
Output is correct |
13 |
Correct |
2 ms |
336 KB |
Output is correct |
14 |
Correct |
1 ms |
336 KB |
Output is correct |
15 |
Correct |
2 ms |
336 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Correct |
1 ms |
336 KB |
Output is correct |
3 |
Correct |
1 ms |
336 KB |
Output is correct |
4 |
Correct |
1 ms |
336 KB |
Output is correct |
5 |
Correct |
1 ms |
336 KB |
Output is correct |
6 |
Correct |
1 ms |
336 KB |
Output is correct |
7 |
Correct |
1 ms |
336 KB |
Output is correct |
8 |
Correct |
1 ms |
336 KB |
Output is correct |
9 |
Correct |
1 ms |
336 KB |
Output is correct |
10 |
Correct |
2 ms |
336 KB |
Output is correct |
11 |
Correct |
2 ms |
336 KB |
Output is correct |
12 |
Correct |
2 ms |
336 KB |
Output is correct |
13 |
Correct |
2 ms |
336 KB |
Output is correct |
14 |
Correct |
1 ms |
336 KB |
Output is correct |
15 |
Correct |
2 ms |
336 KB |
Output is correct |
16 |
Correct |
30 ms |
1144 KB |
Output is correct |
17 |
Correct |
36 ms |
964 KB |
Output is correct |
18 |
Correct |
30 ms |
972 KB |
Output is correct |
19 |
Correct |
30 ms |
972 KB |
Output is correct |
20 |
Correct |
30 ms |
984 KB |
Output is correct |
21 |
Correct |
31 ms |
1144 KB |
Output is correct |
22 |
Correct |
31 ms |
972 KB |
Output is correct |
23 |
Correct |
31 ms |
912 KB |
Output is correct |
24 |
Correct |
30 ms |
972 KB |
Output is correct |