# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
207079 |
2020-03-06T10:58:56 Z |
origami100 |
Stove (JOI18_stove) |
C++11 |
|
85 ms |
2488 KB |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, k;
cin >> n >> k;
int mi = n;
vector <int> entr;
for(int i = 0; i < n; i++){
int a;
cin >> a;
entr.push_back(a);
}
sort(entr.begin(), entr.end());
vector <int> diff;
for(int i = 0; i < n - 1; i++){
diff.push_back(entr[i + 1] - entr[i] - 1);
}
sort(diff.begin(), diff.end());
for(int i = 0; i < n - k; i++){
mi += diff[i];
}
cout << mi;
}
# |
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 |
256 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 |
376 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 |
256 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 |
376 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 |
376 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 |
256 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 |
376 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 |
376 KB |
Output is correct |
14 |
Correct |
7 ms |
376 KB |
Output is correct |
15 |
Correct |
7 ms |
376 KB |
Output is correct |
16 |
Correct |
85 ms |
2420 KB |
Output is correct |
17 |
Correct |
82 ms |
2428 KB |
Output is correct |
18 |
Correct |
77 ms |
2416 KB |
Output is correct |
19 |
Correct |
77 ms |
2416 KB |
Output is correct |
20 |
Correct |
75 ms |
2416 KB |
Output is correct |
21 |
Correct |
80 ms |
2388 KB |
Output is correct |
22 |
Correct |
81 ms |
2428 KB |
Output is correct |
23 |
Correct |
78 ms |
2420 KB |
Output is correct |
24 |
Correct |
80 ms |
2488 KB |
Output is correct |