| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 474264 |
2021-09-17T16:51:41 Z |
R0L3eX |
Stove (JOI18_stove) |
C++14 |
|
57 ms |
2328 KB |
#include <bits/stdc++.h>
using namespace std;
const int mxN = 16000;
int main() {
int n, k; cin >> n >> k;
vector<int> times(n);
for(auto &x:times) cin >> x;
vector<int> values;
for(int i=1; i<n; ++i) values.push_back(times[i]-times[i-1]-1);
sort(values.rbegin(), values.rend());
int total=times[n-1]-times[0]+1;
for(int i=0; i<k-1; ++i) total-=values[i];
cout << total << "\n";
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 ms |
204 KB |
Output is correct |
| 3 |
Correct |
1 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
1 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
204 KB |
Output is correct |
| 7 |
Correct |
1 ms |
204 KB |
Output is correct |
| 8 |
Correct |
1 ms |
204 KB |
Output is correct |
| 9 |
Correct |
1 ms |
256 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 ms |
204 KB |
Output is correct |
| 3 |
Correct |
1 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
1 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
204 KB |
Output is correct |
| 7 |
Correct |
1 ms |
204 KB |
Output is correct |
| 8 |
Correct |
1 ms |
204 KB |
Output is correct |
| 9 |
Correct |
1 ms |
256 KB |
Output is correct |
| 10 |
Correct |
2 ms |
272 KB |
Output is correct |
| 11 |
Correct |
2 ms |
332 KB |
Output is correct |
| 12 |
Correct |
2 ms |
332 KB |
Output is correct |
| 13 |
Correct |
2 ms |
332 KB |
Output is correct |
| 14 |
Correct |
2 ms |
332 KB |
Output is correct |
| 15 |
Correct |
2 ms |
332 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 ms |
204 KB |
Output is correct |
| 3 |
Correct |
1 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
1 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
204 KB |
Output is correct |
| 7 |
Correct |
1 ms |
204 KB |
Output is correct |
| 8 |
Correct |
1 ms |
204 KB |
Output is correct |
| 9 |
Correct |
1 ms |
256 KB |
Output is correct |
| 10 |
Correct |
2 ms |
272 KB |
Output is correct |
| 11 |
Correct |
2 ms |
332 KB |
Output is correct |
| 12 |
Correct |
2 ms |
332 KB |
Output is correct |
| 13 |
Correct |
2 ms |
332 KB |
Output is correct |
| 14 |
Correct |
2 ms |
332 KB |
Output is correct |
| 15 |
Correct |
2 ms |
332 KB |
Output is correct |
| 16 |
Correct |
53 ms |
2160 KB |
Output is correct |
| 17 |
Correct |
52 ms |
2240 KB |
Output is correct |
| 18 |
Correct |
53 ms |
2204 KB |
Output is correct |
| 19 |
Correct |
55 ms |
2328 KB |
Output is correct |
| 20 |
Correct |
52 ms |
2192 KB |
Output is correct |
| 21 |
Correct |
53 ms |
2240 KB |
Output is correct |
| 22 |
Correct |
57 ms |
2200 KB |
Output is correct |
| 23 |
Correct |
57 ms |
2200 KB |
Output is correct |
| 24 |
Correct |
55 ms |
2192 KB |
Output is correct |
