# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
202487 |
2020-02-16T11:21:21 Z |
Yojahuang |
Stove (JOI18_stove) |
C++14 |
|
31 ms |
2420 KB |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAXN = 100005;
int n, k, in[MAXN];
vector<int> G;
int main(){
ios::sync_with_stdio(0),cin.tie(0);
int ret;
while (cin >> n >> k) {
G.clear();
k--;
for (int i = 0; i < n; ++i) {
cin >> in[i];
if (i) G.push_back(in[i] - in[i-1] - 1);
}
ret = in[n-1] - in[0] + 1;
sort(G.begin(), G.end(), greater<int>());
for (int i = 0; i < k; ++i) {
ret -= G[i];
}
cout << ret << '\n';
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
504 KB |
Output is correct |
2 |
Correct |
5 ms |
376 KB |
Output is correct |
3 |
Correct |
5 ms |
376 KB |
Output is correct |
4 |
Correct |
5 ms |
376 KB |
Output is correct |
5 |
Correct |
5 ms |
376 KB |
Output is correct |
6 |
Correct |
5 ms |
376 KB |
Output is correct |
7 |
Correct |
5 ms |
248 KB |
Output is correct |
8 |
Correct |
5 ms |
376 KB |
Output is correct |
9 |
Correct |
5 ms |
248 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
504 KB |
Output is correct |
2 |
Correct |
5 ms |
376 KB |
Output is correct |
3 |
Correct |
5 ms |
376 KB |
Output is correct |
4 |
Correct |
5 ms |
376 KB |
Output is correct |
5 |
Correct |
5 ms |
376 KB |
Output is correct |
6 |
Correct |
5 ms |
376 KB |
Output is correct |
7 |
Correct |
5 ms |
248 KB |
Output is correct |
8 |
Correct |
5 ms |
376 KB |
Output is correct |
9 |
Correct |
5 ms |
248 KB |
Output is correct |
10 |
Correct |
6 ms |
376 KB |
Output is correct |
11 |
Correct |
5 ms |
504 KB |
Output is correct |
12 |
Correct |
5 ms |
376 KB |
Output is correct |
13 |
Correct |
5 ms |
376 KB |
Output is correct |
14 |
Correct |
6 ms |
376 KB |
Output is correct |
15 |
Correct |
5 ms |
380 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
504 KB |
Output is correct |
2 |
Correct |
5 ms |
376 KB |
Output is correct |
3 |
Correct |
5 ms |
376 KB |
Output is correct |
4 |
Correct |
5 ms |
376 KB |
Output is correct |
5 |
Correct |
5 ms |
376 KB |
Output is correct |
6 |
Correct |
5 ms |
376 KB |
Output is correct |
7 |
Correct |
5 ms |
248 KB |
Output is correct |
8 |
Correct |
5 ms |
376 KB |
Output is correct |
9 |
Correct |
5 ms |
248 KB |
Output is correct |
10 |
Correct |
6 ms |
376 KB |
Output is correct |
11 |
Correct |
5 ms |
504 KB |
Output is correct |
12 |
Correct |
5 ms |
376 KB |
Output is correct |
13 |
Correct |
5 ms |
376 KB |
Output is correct |
14 |
Correct |
6 ms |
376 KB |
Output is correct |
15 |
Correct |
5 ms |
380 KB |
Output is correct |
16 |
Correct |
29 ms |
2292 KB |
Output is correct |
17 |
Correct |
28 ms |
2164 KB |
Output is correct |
18 |
Correct |
28 ms |
2176 KB |
Output is correct |
19 |
Correct |
31 ms |
2172 KB |
Output is correct |
20 |
Correct |
29 ms |
2168 KB |
Output is correct |
21 |
Correct |
28 ms |
2420 KB |
Output is correct |
22 |
Correct |
30 ms |
2168 KB |
Output is correct |
23 |
Correct |
31 ms |
2172 KB |
Output is correct |
24 |
Correct |
31 ms |
2420 KB |
Output is correct |