| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 159978 |
2019-10-25T15:59:33 Z |
combi1k1 |
Stove (JOI18_stove) |
C++14 |
|
32 ms |
1316 KB |
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 1;
int n, k;
int t[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n >> k; --k;
priority_queue<int> pq;
for(int i = 1 ; i <= n ; ++i) {
cin >> t[i];
if (i > 1)
pq.push(t[i] - t[i - 1] - 1);
}
int ans = t[n] - t[1] + 1;
for(; k && pq.size() ; --k, pq.pop())
ans -= pq.top();
cout << ans << endl;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Correct |
2 ms |
376 KB |
Output is correct |
| 4 |
Correct |
2 ms |
376 KB |
Output is correct |
| 5 |
Correct |
2 ms |
248 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| 7 |
Correct |
2 ms |
248 KB |
Output is correct |
| 8 |
Correct |
2 ms |
376 KB |
Output is correct |
| 9 |
Correct |
2 ms |
376 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Correct |
2 ms |
376 KB |
Output is correct |
| 4 |
Correct |
2 ms |
376 KB |
Output is correct |
| 5 |
Correct |
2 ms |
248 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| 7 |
Correct |
2 ms |
248 KB |
Output is correct |
| 8 |
Correct |
2 ms |
376 KB |
Output is correct |
| 9 |
Correct |
2 ms |
376 KB |
Output is correct |
| 10 |
Correct |
3 ms |
376 KB |
Output is correct |
| 11 |
Correct |
2 ms |
376 KB |
Output is correct |
| 12 |
Correct |
4 ms |
376 KB |
Output is correct |
| 13 |
Correct |
3 ms |
376 KB |
Output is correct |
| 14 |
Correct |
3 ms |
376 KB |
Output is correct |
| 15 |
Correct |
3 ms |
376 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Correct |
2 ms |
376 KB |
Output is correct |
| 4 |
Correct |
2 ms |
376 KB |
Output is correct |
| 5 |
Correct |
2 ms |
248 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| 7 |
Correct |
2 ms |
248 KB |
Output is correct |
| 8 |
Correct |
2 ms |
376 KB |
Output is correct |
| 9 |
Correct |
2 ms |
376 KB |
Output is correct |
| 10 |
Correct |
3 ms |
376 KB |
Output is correct |
| 11 |
Correct |
2 ms |
376 KB |
Output is correct |
| 12 |
Correct |
4 ms |
376 KB |
Output is correct |
| 13 |
Correct |
3 ms |
376 KB |
Output is correct |
| 14 |
Correct |
3 ms |
376 KB |
Output is correct |
| 15 |
Correct |
3 ms |
376 KB |
Output is correct |
| 16 |
Correct |
19 ms |
1272 KB |
Output is correct |
| 17 |
Correct |
19 ms |
1272 KB |
Output is correct |
| 18 |
Correct |
19 ms |
1272 KB |
Output is correct |
| 19 |
Correct |
20 ms |
1204 KB |
Output is correct |
| 20 |
Correct |
26 ms |
1272 KB |
Output is correct |
| 21 |
Correct |
31 ms |
1308 KB |
Output is correct |
| 22 |
Correct |
31 ms |
1244 KB |
Output is correct |
| 23 |
Correct |
32 ms |
1272 KB |
Output is correct |
| 24 |
Correct |
32 ms |
1316 KB |
Output is correct |
