# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
365831 |
2021-02-12T12:35:26 Z |
_zheksenov |
Stove (JOI18_stove) |
C++17 |
|
56 ms |
1772 KB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
signed main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int& x : a)
cin >> x;
for (int i = 0; i < n; i++) {
if (i > 0) {
a[i - 1] = a[i] - a[i - 1] - 1;
}
}
sort(a.begin(), a.end() - 1);
ll ans = n;
for (int i = 0; i < n - k; i++) {
ans += a[i];
}
cout << ans << "\n";
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 |
2 ms |
364 KB |
Output is correct |
11 |
Correct |
2 ms |
364 KB |
Output is correct |
12 |
Correct |
2 ms |
364 KB |
Output is correct |
13 |
Correct |
3 ms |
388 KB |
Output is correct |
14 |
Correct |
3 ms |
492 KB |
Output is correct |
15 |
Correct |
2 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 |
2 ms |
364 KB |
Output is correct |
11 |
Correct |
2 ms |
364 KB |
Output is correct |
12 |
Correct |
2 ms |
364 KB |
Output is correct |
13 |
Correct |
3 ms |
388 KB |
Output is correct |
14 |
Correct |
3 ms |
492 KB |
Output is correct |
15 |
Correct |
2 ms |
364 KB |
Output is correct |
16 |
Correct |
56 ms |
1644 KB |
Output is correct |
17 |
Correct |
52 ms |
1644 KB |
Output is correct |
18 |
Correct |
50 ms |
1644 KB |
Output is correct |
19 |
Correct |
50 ms |
1644 KB |
Output is correct |
20 |
Correct |
50 ms |
1772 KB |
Output is correct |
21 |
Correct |
50 ms |
1644 KB |
Output is correct |
22 |
Correct |
51 ms |
1644 KB |
Output is correct |
23 |
Correct |
50 ms |
1644 KB |
Output is correct |
24 |
Correct |
51 ms |
1772 KB |
Output is correct |