| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 202978 |
2020-02-18T20:35:54 Z |
Harry464 |
Stove (JOI18_stove) |
C++14 |
|
86 ms |
3312 KB |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector <long long> a(n);
vector <long long> dif;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n - 1; i++)
if (a[i+1] - a[i] > 1)
dif.push_back(a[i+1] - a[i] - 1);
sort(dif.begin(),dif.end());
int s = dif.size();
long long suma = a[n-1] + 1 - a[0];
for (int i = 0; i < m - 1 && s - 1 - i >= 0; i++)
suma -= dif[s - 1 - i];
cout << suma;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
256 KB |
Output is correct |
| 2 |
Correct |
5 ms |
256 KB |
Output is correct |
| 3 |
Correct |
5 ms |
364 KB |
Output is correct |
| 4 |
Correct |
5 ms |
256 KB |
Output is correct |
| 5 |
Correct |
5 ms |
256 KB |
Output is correct |
| 6 |
Correct |
5 ms |
256 KB |
Output is correct |
| 7 |
Correct |
5 ms |
256 KB |
Output is correct |
| 8 |
Correct |
5 ms |
256 KB |
Output is correct |
| 9 |
Correct |
5 ms |
376 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
256 KB |
Output is correct |
| 2 |
Correct |
5 ms |
256 KB |
Output is correct |
| 3 |
Correct |
5 ms |
364 KB |
Output is correct |
| 4 |
Correct |
5 ms |
256 KB |
Output is correct |
| 5 |
Correct |
5 ms |
256 KB |
Output is correct |
| 6 |
Correct |
5 ms |
256 KB |
Output is correct |
| 7 |
Correct |
5 ms |
256 KB |
Output is correct |
| 8 |
Correct |
5 ms |
256 KB |
Output is correct |
| 9 |
Correct |
5 ms |
376 KB |
Output is correct |
| 10 |
Correct |
7 ms |
376 KB |
Output is correct |
| 11 |
Correct |
7 ms |
376 KB |
Output is correct |
| 12 |
Correct |
7 ms |
376 KB |
Output is correct |
| 13 |
Correct |
7 ms |
380 KB |
Output is correct |
| 14 |
Correct |
7 ms |
376 KB |
Output is correct |
| 15 |
Correct |
7 ms |
376 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
256 KB |
Output is correct |
| 2 |
Correct |
5 ms |
256 KB |
Output is correct |
| 3 |
Correct |
5 ms |
364 KB |
Output is correct |
| 4 |
Correct |
5 ms |
256 KB |
Output is correct |
| 5 |
Correct |
5 ms |
256 KB |
Output is correct |
| 6 |
Correct |
5 ms |
256 KB |
Output is correct |
| 7 |
Correct |
5 ms |
256 KB |
Output is correct |
| 8 |
Correct |
5 ms |
256 KB |
Output is correct |
| 9 |
Correct |
5 ms |
376 KB |
Output is correct |
| 10 |
Correct |
7 ms |
376 KB |
Output is correct |
| 11 |
Correct |
7 ms |
376 KB |
Output is correct |
| 12 |
Correct |
7 ms |
376 KB |
Output is correct |
| 13 |
Correct |
7 ms |
380 KB |
Output is correct |
| 14 |
Correct |
7 ms |
376 KB |
Output is correct |
| 15 |
Correct |
7 ms |
376 KB |
Output is correct |
| 16 |
Correct |
77 ms |
3260 KB |
Output is correct |
| 17 |
Correct |
74 ms |
3184 KB |
Output is correct |
| 18 |
Correct |
75 ms |
3188 KB |
Output is correct |
| 19 |
Correct |
84 ms |
3264 KB |
Output is correct |
| 20 |
Correct |
86 ms |
3184 KB |
Output is correct |
| 21 |
Correct |
74 ms |
3184 KB |
Output is correct |
| 22 |
Correct |
75 ms |
3312 KB |
Output is correct |
| 23 |
Correct |
74 ms |
3184 KB |
Output is correct |
| 24 |
Correct |
79 ms |
3184 KB |
Output is correct |
