| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 959958 |
2024-04-09T11:15:40 Z |
okkoo |
Stove (JOI18_stove) |
C++17 |
|
17 ms |
2452 KB |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
#define fastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main(){
fastIO;
int n, k;
cin >> n >> k;
k--;
int a[n];
for(int i=0; i<n; i++) cin >> a[i];
int ans = a[n-1] - a[0] + 1;
vector<int> gaps;
for(int i=1; i<n; i++){
gaps.push_back(a[i] - a[i-1] - 1);
}
sort(gaps.begin(), gaps.end());
int sz = gaps.size()-1;
for(int i=sz; k>0 && i>=0; i--, k--){
ans -= gaps[i];
}
cout << ans << '\n';
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 ms |
460 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 |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 ms |
460 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 |
468 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 |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 ms |
460 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 |
468 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 |
15 ms |
2272 KB |
Output is correct |
| 17 |
Correct |
15 ms |
2368 KB |
Output is correct |
| 18 |
Correct |
16 ms |
2272 KB |
Output is correct |
| 19 |
Correct |
14 ms |
2272 KB |
Output is correct |
| 20 |
Correct |
14 ms |
2452 KB |
Output is correct |
| 21 |
Correct |
14 ms |
2272 KB |
Output is correct |
| 22 |
Correct |
14 ms |
2236 KB |
Output is correct |
| 23 |
Correct |
15 ms |
2268 KB |
Output is correct |
| 24 |
Correct |
17 ms |
2272 KB |
Output is correct |
