| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 262365 |
2020-08-12T17:19:57 Z |
sahil_k |
Stove (JOI18_stove) |
C++14 |
|
23 ms |
2432 KB |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define MAXN 100005
int n, k;
int t[MAXN];
vector<int> dif;
int o = 0;
int main () {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k;
for (int i=0; i<n; i++) {
cin >> t[i];
}
for (int i=1; i<n; i++) {
dif.push_back(t[i]-t[i-1]-1);
}
sort(dif.begin(), dif.end());
k--;
while (k--) {
if (dif.back() > 0) o += dif.back();
dif.pop_back();
}
o = t[n-1]-t[0]+1-o;
cout << o << endl;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
Output is correct |
| 2 |
Correct |
0 ms |
384 KB |
Output is correct |
| 3 |
Correct |
0 ms |
384 KB |
Output is correct |
| 4 |
Correct |
1 ms |
384 KB |
Output is correct |
| 5 |
Correct |
1 ms |
384 KB |
Output is correct |
| 6 |
Correct |
1 ms |
384 KB |
Output is correct |
| 7 |
Correct |
1 ms |
384 KB |
Output is correct |
| 8 |
Correct |
1 ms |
384 KB |
Output is correct |
| 9 |
Correct |
1 ms |
384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
Output is correct |
| 2 |
Correct |
0 ms |
384 KB |
Output is correct |
| 3 |
Correct |
0 ms |
384 KB |
Output is correct |
| 4 |
Correct |
1 ms |
384 KB |
Output is correct |
| 5 |
Correct |
1 ms |
384 KB |
Output is correct |
| 6 |
Correct |
1 ms |
384 KB |
Output is correct |
| 7 |
Correct |
1 ms |
384 KB |
Output is correct |
| 8 |
Correct |
1 ms |
384 KB |
Output is correct |
| 9 |
Correct |
1 ms |
384 KB |
Output is correct |
| 10 |
Correct |
1 ms |
384 KB |
Output is correct |
| 11 |
Correct |
1 ms |
384 KB |
Output is correct |
| 12 |
Correct |
1 ms |
384 KB |
Output is correct |
| 13 |
Correct |
1 ms |
384 KB |
Output is correct |
| 14 |
Correct |
1 ms |
384 KB |
Output is correct |
| 15 |
Correct |
1 ms |
384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
Output is correct |
| 2 |
Correct |
0 ms |
384 KB |
Output is correct |
| 3 |
Correct |
0 ms |
384 KB |
Output is correct |
| 4 |
Correct |
1 ms |
384 KB |
Output is correct |
| 5 |
Correct |
1 ms |
384 KB |
Output is correct |
| 6 |
Correct |
1 ms |
384 KB |
Output is correct |
| 7 |
Correct |
1 ms |
384 KB |
Output is correct |
| 8 |
Correct |
1 ms |
384 KB |
Output is correct |
| 9 |
Correct |
1 ms |
384 KB |
Output is correct |
| 10 |
Correct |
1 ms |
384 KB |
Output is correct |
| 11 |
Correct |
1 ms |
384 KB |
Output is correct |
| 12 |
Correct |
1 ms |
384 KB |
Output is correct |
| 13 |
Correct |
1 ms |
384 KB |
Output is correct |
| 14 |
Correct |
1 ms |
384 KB |
Output is correct |
| 15 |
Correct |
1 ms |
384 KB |
Output is correct |
| 16 |
Correct |
22 ms |
2432 KB |
Output is correct |
| 17 |
Correct |
20 ms |
2432 KB |
Output is correct |
| 18 |
Correct |
21 ms |
2304 KB |
Output is correct |
| 19 |
Correct |
20 ms |
2304 KB |
Output is correct |
| 20 |
Correct |
21 ms |
2304 KB |
Output is correct |
| 21 |
Correct |
20 ms |
2304 KB |
Output is correct |
| 22 |
Correct |
21 ms |
2304 KB |
Output is correct |
| 23 |
Correct |
23 ms |
2304 KB |
Output is correct |
| 24 |
Correct |
22 ms |
2304 KB |
Output is correct |
