| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1091253 |
2024-09-20T09:32:00 Z |
vjudge1 |
Stove (JOI18_stove) |
C++17 |
|
17 ms |
2000 KB |
#include <bits/stdc++.h>
#define int long long int
using namespace std;
int32_t main(){
ios::sync_with_stdio(0), cout.tie(0), cin.tie(0);
int n ,k;
cin >> n >> k;
int t[n + 10] = {};
for(int i = 0; i < n ;i ++){
cin >> t[i];
}
k--;
int dif[n + 10] = {};
for(int i = 0 ;i < n - 1; i++){
dif[i] = (t[i + 1] - (t[i] + 1));
}
sort(dif, dif + n, greater<int>());
int ans = (t[n - 1] + 1) - t[0];
for(int i = 0 ;i < k; i++){
ans -= dif[i];
}
cout << ans << endl;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 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 |
348 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 |
344 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 |
348 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 |
344 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 |
472 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 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 |
348 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 |
344 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 |
472 KB |
Output is correct |
| 16 |
Correct |
16 ms |
1884 KB |
Output is correct |
| 17 |
Correct |
17 ms |
1884 KB |
Output is correct |
| 18 |
Correct |
13 ms |
1884 KB |
Output is correct |
| 19 |
Correct |
13 ms |
1880 KB |
Output is correct |
| 20 |
Correct |
13 ms |
1884 KB |
Output is correct |
| 21 |
Correct |
13 ms |
1884 KB |
Output is correct |
| 22 |
Correct |
13 ms |
1884 KB |
Output is correct |
| 23 |
Correct |
13 ms |
1884 KB |
Output is correct |
| 24 |
Correct |
13 ms |
2000 KB |
Output is correct |
