| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 322086 |
2020-11-14T03:36:35 Z |
kwongweng |
Stove (JOI18_stove) |
C++14 |
|
52 ms |
2156 KB |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i = a; i < b; i++)
int main(){
int n, k; cin >> n >> k;
vector<int> t(n); FOR(i, 0, n) cin >> t[i];
int ans = t[n-1] + 1 - t[0];
vector<int> d(n-1);
FOR(i, 0, n-1){
d[i] = t[i+1] - t[i] - 1;
}
sort(d.begin(), d.end());
FOR(i, n-k, n-1){
ans -= d[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 |
620 KB |
Output is correct |
| 11 |
Correct |
2 ms |
364 KB |
Output is correct |
| 12 |
Correct |
3 ms |
364 KB |
Output is correct |
| 13 |
Correct |
2 ms |
364 KB |
Output is correct |
| 14 |
Correct |
2 ms |
500 KB |
Output is correct |
| 15 |
Correct |
3 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 |
620 KB |
Output is correct |
| 11 |
Correct |
2 ms |
364 KB |
Output is correct |
| 12 |
Correct |
3 ms |
364 KB |
Output is correct |
| 13 |
Correct |
2 ms |
364 KB |
Output is correct |
| 14 |
Correct |
2 ms |
500 KB |
Output is correct |
| 15 |
Correct |
3 ms |
364 KB |
Output is correct |
| 16 |
Correct |
51 ms |
2028 KB |
Output is correct |
| 17 |
Correct |
51 ms |
2156 KB |
Output is correct |
| 18 |
Correct |
52 ms |
2028 KB |
Output is correct |
| 19 |
Correct |
50 ms |
2028 KB |
Output is correct |
| 20 |
Correct |
50 ms |
2028 KB |
Output is correct |
| 21 |
Correct |
51 ms |
2156 KB |
Output is correct |
| 22 |
Correct |
51 ms |
2028 KB |
Output is correct |
| 23 |
Correct |
51 ms |
2028 KB |
Output is correct |
| 24 |
Correct |
51 ms |
2028 KB |
Output is correct |
