| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 247403 |
2020-07-11T10:29:34 Z |
Berted |
Stove (JOI18_stove) |
C++14 |
|
80 ms |
1680 KB |
#include <iostream>
#include <algorithm>
using namespace std;
int n, k, ar[100001] = {}, res = 0;
int main()
{
cin >> n >> k;
for (int i = 0; i < n; i++) cin >> ar[i];
for (int i = n - 1; i; i--)
{
ar[i] -= ar[i - 1] + 1;
}
sort(ar + 1, ar + n);
for (int i = 1; i <= n - k; i++) {res += ar[i];}
cout << res + n << "\n";
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
Output is correct |
| 2 |
Correct |
5 ms |
256 KB |
Output is correct |
| 3 |
Correct |
5 ms |
432 KB |
Output is correct |
| 4 |
Correct |
5 ms |
384 KB |
Output is correct |
| 5 |
Correct |
5 ms |
384 KB |
Output is correct |
| 6 |
Correct |
5 ms |
384 KB |
Output is correct |
| 7 |
Correct |
4 ms |
256 KB |
Output is correct |
| 8 |
Correct |
5 ms |
384 KB |
Output is correct |
| 9 |
Correct |
4 ms |
384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
Output is correct |
| 2 |
Correct |
5 ms |
256 KB |
Output is correct |
| 3 |
Correct |
5 ms |
432 KB |
Output is correct |
| 4 |
Correct |
5 ms |
384 KB |
Output is correct |
| 5 |
Correct |
5 ms |
384 KB |
Output is correct |
| 6 |
Correct |
5 ms |
384 KB |
Output is correct |
| 7 |
Correct |
4 ms |
256 KB |
Output is correct |
| 8 |
Correct |
5 ms |
384 KB |
Output is correct |
| 9 |
Correct |
4 ms |
384 KB |
Output is correct |
| 10 |
Correct |
7 ms |
384 KB |
Output is correct |
| 11 |
Correct |
6 ms |
384 KB |
Output is correct |
| 12 |
Correct |
7 ms |
384 KB |
Output is correct |
| 13 |
Correct |
7 ms |
384 KB |
Output is correct |
| 14 |
Correct |
7 ms |
384 KB |
Output is correct |
| 15 |
Correct |
7 ms |
384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
Output is correct |
| 2 |
Correct |
5 ms |
256 KB |
Output is correct |
| 3 |
Correct |
5 ms |
432 KB |
Output is correct |
| 4 |
Correct |
5 ms |
384 KB |
Output is correct |
| 5 |
Correct |
5 ms |
384 KB |
Output is correct |
| 6 |
Correct |
5 ms |
384 KB |
Output is correct |
| 7 |
Correct |
4 ms |
256 KB |
Output is correct |
| 8 |
Correct |
5 ms |
384 KB |
Output is correct |
| 9 |
Correct |
4 ms |
384 KB |
Output is correct |
| 10 |
Correct |
7 ms |
384 KB |
Output is correct |
| 11 |
Correct |
6 ms |
384 KB |
Output is correct |
| 12 |
Correct |
7 ms |
384 KB |
Output is correct |
| 13 |
Correct |
7 ms |
384 KB |
Output is correct |
| 14 |
Correct |
7 ms |
384 KB |
Output is correct |
| 15 |
Correct |
7 ms |
384 KB |
Output is correct |
| 16 |
Correct |
71 ms |
1656 KB |
Output is correct |
| 17 |
Correct |
72 ms |
1656 KB |
Output is correct |
| 18 |
Correct |
80 ms |
1680 KB |
Output is correct |
| 19 |
Correct |
71 ms |
1656 KB |
Output is correct |
| 20 |
Correct |
71 ms |
1656 KB |
Output is correct |
| 21 |
Correct |
72 ms |
1656 KB |
Output is correct |
| 22 |
Correct |
71 ms |
1656 KB |
Output is correct |
| 23 |
Correct |
73 ms |
1656 KB |
Output is correct |
| 24 |
Correct |
73 ms |
1656 KB |
Output is correct |
