# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
868956 |
2023-11-02T14:20:47 Z |
autoastt |
Stove (JOI18_stove) |
C++14 |
|
41 ms |
1492 KB |
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+5;
int a[N], b[N], cnt, ans;
int main(){
int n, k;
cin >> n >> k;
vector<int> v;
for(int i = 0; i < n; i++){
cin >> a[i];
if(i > 0) v.push_back(a[i]-a[i-1]-1);
}
sort(v.begin(), v.end());
for(int i = 0; i < n-k; i++){
ans += v[i];
}
cout << ans + n;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
348 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 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
348 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 |
348 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 |
348 KB |
Output is correct |
14 |
Correct |
1 ms |
348 KB |
Output is correct |
15 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
348 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 |
348 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 |
348 KB |
Output is correct |
14 |
Correct |
1 ms |
348 KB |
Output is correct |
15 |
Correct |
1 ms |
348 KB |
Output is correct |
16 |
Correct |
33 ms |
1492 KB |
Output is correct |
17 |
Correct |
36 ms |
1152 KB |
Output is correct |
18 |
Correct |
33 ms |
1236 KB |
Output is correct |
19 |
Correct |
33 ms |
1240 KB |
Output is correct |
20 |
Correct |
33 ms |
1240 KB |
Output is correct |
21 |
Correct |
33 ms |
1240 KB |
Output is correct |
22 |
Correct |
41 ms |
1204 KB |
Output is correct |
23 |
Correct |
33 ms |
1240 KB |
Output is correct |
24 |
Correct |
33 ms |
1236 KB |
Output is correct |