| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 587577 |
2022-07-02T05:55:42 Z |
dryeab |
Stove (JOI18_stove) |
C++17 |
|
30 ms |
2056 KB |
#include <bits/stdc++.h>
using namespace std;
const int M = 1e5 + 5;
int t[M];
int gap[M];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
for (int i = 0; i < n; ++i)
cin >> t[i];
int res = n;
if (k >= n)
{
cout << res << endl;
return 0;
}
sort(t, t + n);
for (int i = 1; i < n; ++i)
gap[i - 1] = -(t[i] - t[i - 1] - 1);
sort(gap, gap + n - 1);
k--;
for (int i = k; i < n - 1; ++i)
res += -gap[i];
cout << res << endl;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
328 KB |
Output is correct |
| 5 |
Correct |
0 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
332 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
328 KB |
Output is correct |
| 5 |
Correct |
0 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
332 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
396 KB |
Output is correct |
| 11 |
Correct |
2 ms |
340 KB |
Output is correct |
| 12 |
Correct |
1 ms |
340 KB |
Output is correct |
| 13 |
Correct |
1 ms |
340 KB |
Output is correct |
| 14 |
Correct |
1 ms |
340 KB |
Output is correct |
| 15 |
Correct |
1 ms |
344 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
328 KB |
Output is correct |
| 5 |
Correct |
0 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
332 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
396 KB |
Output is correct |
| 11 |
Correct |
2 ms |
340 KB |
Output is correct |
| 12 |
Correct |
1 ms |
340 KB |
Output is correct |
| 13 |
Correct |
1 ms |
340 KB |
Output is correct |
| 14 |
Correct |
1 ms |
340 KB |
Output is correct |
| 15 |
Correct |
1 ms |
344 KB |
Output is correct |
| 16 |
Correct |
19 ms |
1968 KB |
Output is correct |
| 17 |
Correct |
18 ms |
1996 KB |
Output is correct |
| 18 |
Correct |
26 ms |
2036 KB |
Output is correct |
| 19 |
Correct |
19 ms |
2004 KB |
Output is correct |
| 20 |
Correct |
30 ms |
2052 KB |
Output is correct |
| 21 |
Correct |
17 ms |
1980 KB |
Output is correct |
| 22 |
Correct |
19 ms |
2056 KB |
Output is correct |
| 23 |
Correct |
20 ms |
1948 KB |
Output is correct |
| 24 |
Correct |
18 ms |
2004 KB |
Output is correct |
