# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
364481 |
2021-02-09T10:13:47 Z |
NachoLibre |
Stove (JOI18_stove) |
C++17 |
|
22 ms |
1772 KB |
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n, k, a[N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
if(n == 1) return cout << 1 << endl, 0;
for(int i = 0; i < n; ++i) {
cin >> a[i];
if(i) a[i - 1] = a[i] - a[i - 1] - 1;
}
sort(a, a + n - 1);
long long fp = n;
for(int i = 0; i < n - k; ++i) {
fp += a[i];
}
cout << fp << endl;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
1 ms |
364 KB |
Output is correct |
5 |
Correct |
1 ms |
364 KB |
Output is correct |
6 |
Correct |
1 ms |
364 KB |
Output is correct |
7 |
Correct |
1 ms |
364 KB |
Output is correct |
8 |
Correct |
1 ms |
364 KB |
Output is correct |
9 |
Correct |
1 ms |
364 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
1 ms |
364 KB |
Output is correct |
5 |
Correct |
1 ms |
364 KB |
Output is correct |
6 |
Correct |
1 ms |
364 KB |
Output is correct |
7 |
Correct |
1 ms |
364 KB |
Output is correct |
8 |
Correct |
1 ms |
364 KB |
Output is correct |
9 |
Correct |
1 ms |
364 KB |
Output is correct |
10 |
Correct |
1 ms |
364 KB |
Output is correct |
11 |
Correct |
1 ms |
364 KB |
Output is correct |
12 |
Correct |
1 ms |
492 KB |
Output is correct |
13 |
Correct |
2 ms |
364 KB |
Output is correct |
14 |
Correct |
2 ms |
364 KB |
Output is correct |
15 |
Correct |
1 ms |
364 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
1 ms |
364 KB |
Output is correct |
5 |
Correct |
1 ms |
364 KB |
Output is correct |
6 |
Correct |
1 ms |
364 KB |
Output is correct |
7 |
Correct |
1 ms |
364 KB |
Output is correct |
8 |
Correct |
1 ms |
364 KB |
Output is correct |
9 |
Correct |
1 ms |
364 KB |
Output is correct |
10 |
Correct |
1 ms |
364 KB |
Output is correct |
11 |
Correct |
1 ms |
364 KB |
Output is correct |
12 |
Correct |
1 ms |
492 KB |
Output is correct |
13 |
Correct |
2 ms |
364 KB |
Output is correct |
14 |
Correct |
2 ms |
364 KB |
Output is correct |
15 |
Correct |
1 ms |
364 KB |
Output is correct |
16 |
Correct |
20 ms |
1644 KB |
Output is correct |
17 |
Correct |
20 ms |
1644 KB |
Output is correct |
18 |
Correct |
20 ms |
1644 KB |
Output is correct |
19 |
Correct |
20 ms |
1644 KB |
Output is correct |
20 |
Correct |
20 ms |
1772 KB |
Output is correct |
21 |
Correct |
20 ms |
1644 KB |
Output is correct |
22 |
Correct |
20 ms |
1644 KB |
Output is correct |
23 |
Correct |
21 ms |
1644 KB |
Output is correct |
24 |
Correct |
22 ms |
1772 KB |
Output is correct |