# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
311496 |
2020-10-10T13:27:57 Z |
MSAAD |
Stove (JOI18_stove) |
C++17 |
|
98 ms |
3704 KB |
#include <iostream>
#include <vector>
#include <algorithm>
#define int long long
signed main() {
int n , k;
std::cin >> n >> k;
std::vector <int> a(n) , d(n);
for (int i = 0;i < n;i++) {
std::cin >> a[i];
}
int ans = a.back() - a[0] + 1;
for (int i = 1;i < n;i++) {
d.push_back(a[i] - a[i-1] - 1);
}
std::sort(d.rbegin(),d.rend());
for (int i = 0;i < k - 1;i++) {
ans -= d[i];
}
std::cout << ans << std::endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
1 ms |
256 KB |
Output is correct |
3 |
Correct |
1 ms |
256 KB |
Output is correct |
4 |
Correct |
0 ms |
256 KB |
Output is correct |
5 |
Correct |
0 ms |
256 KB |
Output is correct |
6 |
Correct |
0 ms |
256 KB |
Output is correct |
7 |
Correct |
1 ms |
256 KB |
Output is correct |
8 |
Correct |
0 ms |
256 KB |
Output is correct |
9 |
Correct |
1 ms |
256 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
1 ms |
256 KB |
Output is correct |
3 |
Correct |
1 ms |
256 KB |
Output is correct |
4 |
Correct |
0 ms |
256 KB |
Output is correct |
5 |
Correct |
0 ms |
256 KB |
Output is correct |
6 |
Correct |
0 ms |
256 KB |
Output is correct |
7 |
Correct |
1 ms |
256 KB |
Output is correct |
8 |
Correct |
0 ms |
256 KB |
Output is correct |
9 |
Correct |
1 ms |
256 KB |
Output is correct |
10 |
Correct |
3 ms |
384 KB |
Output is correct |
11 |
Correct |
3 ms |
384 KB |
Output is correct |
12 |
Correct |
3 ms |
384 KB |
Output is correct |
13 |
Correct |
3 ms |
384 KB |
Output is correct |
14 |
Correct |
4 ms |
512 KB |
Output is correct |
15 |
Correct |
4 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
1 ms |
256 KB |
Output is correct |
3 |
Correct |
1 ms |
256 KB |
Output is correct |
4 |
Correct |
0 ms |
256 KB |
Output is correct |
5 |
Correct |
0 ms |
256 KB |
Output is correct |
6 |
Correct |
0 ms |
256 KB |
Output is correct |
7 |
Correct |
1 ms |
256 KB |
Output is correct |
8 |
Correct |
0 ms |
256 KB |
Output is correct |
9 |
Correct |
1 ms |
256 KB |
Output is correct |
10 |
Correct |
3 ms |
384 KB |
Output is correct |
11 |
Correct |
3 ms |
384 KB |
Output is correct |
12 |
Correct |
3 ms |
384 KB |
Output is correct |
13 |
Correct |
3 ms |
384 KB |
Output is correct |
14 |
Correct |
4 ms |
512 KB |
Output is correct |
15 |
Correct |
4 ms |
384 KB |
Output is correct |
16 |
Correct |
95 ms |
3688 KB |
Output is correct |
17 |
Correct |
98 ms |
3688 KB |
Output is correct |
18 |
Correct |
97 ms |
3704 KB |
Output is correct |
19 |
Correct |
94 ms |
3688 KB |
Output is correct |
20 |
Correct |
96 ms |
3688 KB |
Output is correct |
21 |
Correct |
97 ms |
3704 KB |
Output is correct |
22 |
Correct |
93 ms |
3692 KB |
Output is correct |
23 |
Correct |
95 ms |
3688 KB |
Output is correct |
24 |
Correct |
93 ms |
3688 KB |
Output is correct |