# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
524437 |
2022-02-09T08:24:31 Z |
itachi |
Stove (JOI18_stove) |
C++14 |
|
23 ms |
2244 KB |
#include<iostream>
#include<vector>
#include<map>
#include<algorithm>
#include<iomanip>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n,k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; i++)
{
cin>>v[i];
}
vector<int> space(n);
for(int i=0;i<n-1;i++){
space[i] = v[i+1]-v[i] - 1;
}
sort(space.begin(),space.end(),greater<int>());
int ans = v[n-1]-v[0] + 1;
for(int i=0;i<k-1;i++){
ans -= space[i];
}
cout << ans << endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
316 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
0 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
0 ms |
204 KB |
Output is correct |
9 |
Correct |
0 ms |
204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
316 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
0 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
0 ms |
204 KB |
Output is correct |
9 |
Correct |
0 ms |
204 KB |
Output is correct |
10 |
Correct |
1 ms |
332 KB |
Output is correct |
11 |
Correct |
1 ms |
332 KB |
Output is correct |
12 |
Correct |
1 ms |
332 KB |
Output is correct |
13 |
Correct |
1 ms |
332 KB |
Output is correct |
14 |
Correct |
1 ms |
332 KB |
Output is correct |
15 |
Correct |
1 ms |
332 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
316 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
0 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
0 ms |
204 KB |
Output is correct |
9 |
Correct |
0 ms |
204 KB |
Output is correct |
10 |
Correct |
1 ms |
332 KB |
Output is correct |
11 |
Correct |
1 ms |
332 KB |
Output is correct |
12 |
Correct |
1 ms |
332 KB |
Output is correct |
13 |
Correct |
1 ms |
332 KB |
Output is correct |
14 |
Correct |
1 ms |
332 KB |
Output is correct |
15 |
Correct |
1 ms |
332 KB |
Output is correct |
16 |
Correct |
19 ms |
2116 KB |
Output is correct |
17 |
Correct |
17 ms |
1960 KB |
Output is correct |
18 |
Correct |
16 ms |
1988 KB |
Output is correct |
19 |
Correct |
16 ms |
2056 KB |
Output is correct |
20 |
Correct |
17 ms |
1968 KB |
Output is correct |
21 |
Correct |
17 ms |
1988 KB |
Output is correct |
22 |
Correct |
23 ms |
2244 KB |
Output is correct |
23 |
Correct |
16 ms |
1960 KB |
Output is correct |
24 |
Correct |
17 ms |
1996 KB |
Output is correct |