| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 866652 |
2023-10-26T15:35:47 Z |
maks007 |
Stove (JOI18_stove) |
C++14 |
|
46 ms |
3332 KB |
#include "bits/stdc++.h"
using namespace std;
#define int long long
signed main () {
int n, k;
cin >> n >> k;
vector <int> a(n + 1);
for(int i = 1; i <= n; i ++) cin >> a[i];
priority_queue <int> q;
for(int i = 2; i <= n; i ++) q.push(a[i]-a[i-1]-1);
int dist = a[n]-a[1]+1;
k --;
while(q.size() && k --) {
int v = q.top();
q.pop();
dist -= v;
}
cout << dist;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
344 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 |
440 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 |
1 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
344 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 |
440 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 |
1 ms |
348 KB |
Output is correct |
| 10 |
Correct |
2 ms |
344 KB |
Output is correct |
| 11 |
Correct |
2 ms |
348 KB |
Output is correct |
| 12 |
Correct |
1 ms |
348 KB |
Output is correct |
| 13 |
Correct |
1 ms |
444 KB |
Output is correct |
| 14 |
Correct |
2 ms |
348 KB |
Output is correct |
| 15 |
Correct |
2 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
344 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 |
440 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 |
1 ms |
348 KB |
Output is correct |
| 10 |
Correct |
2 ms |
344 KB |
Output is correct |
| 11 |
Correct |
2 ms |
348 KB |
Output is correct |
| 12 |
Correct |
1 ms |
348 KB |
Output is correct |
| 13 |
Correct |
1 ms |
444 KB |
Output is correct |
| 14 |
Correct |
2 ms |
348 KB |
Output is correct |
| 15 |
Correct |
2 ms |
348 KB |
Output is correct |
| 16 |
Correct |
31 ms |
3284 KB |
Output is correct |
| 17 |
Correct |
29 ms |
3332 KB |
Output is correct |
| 18 |
Correct |
30 ms |
3284 KB |
Output is correct |
| 19 |
Correct |
39 ms |
3284 KB |
Output is correct |
| 20 |
Correct |
34 ms |
3284 KB |
Output is correct |
| 21 |
Correct |
38 ms |
3276 KB |
Output is correct |
| 22 |
Correct |
46 ms |
3320 KB |
Output is correct |
| 23 |
Correct |
42 ms |
3316 KB |
Output is correct |
| 24 |
Correct |
46 ms |
3120 KB |
Output is correct |
