# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
319448 |
2020-11-05T10:29:11 Z |
vojin |
Stove (JOI18_stove) |
C++14 |
|
26 ms |
2304 KB |
#include <bits/stdc++.h>
#define FOR(n) for(int i = 0; i < n; i++)
#define ll long long
using namespace std;
int n,k,a[100000],b[100000];
int main()
{
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);cerr.tie(0);
cin >> n >> k;
FOR(n) cin >> a[i];
sort(a,a+n);
int ans = n;
int m = 1;
for(int i = 0; i < n -1;i ++) {b[i] = a[i+1]-a[i]-1;if(b[i]!=0)m++;}
sort(b,b+n-1);
int j = 0;
int cnt = 0;
while(cnt<m-k){
if(b[j]!=0) ans += b[j],cnt++;
j++;
}
cout << ans << endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
492 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
1 ms |
364 KB |
Output is correct |
5 |
Correct |
1 ms |
364 KB |
Output is correct |
6 |
Correct |
1 ms |
396 KB |
Output is correct |
7 |
Correct |
1 ms |
364 KB |
Output is correct |
8 |
Correct |
1 ms |
364 KB |
Output is correct |
9 |
Correct |
1 ms |
364 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
492 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
1 ms |
364 KB |
Output is correct |
5 |
Correct |
1 ms |
364 KB |
Output is correct |
6 |
Correct |
1 ms |
396 KB |
Output is correct |
7 |
Correct |
1 ms |
364 KB |
Output is correct |
8 |
Correct |
1 ms |
364 KB |
Output is correct |
9 |
Correct |
1 ms |
364 KB |
Output is correct |
10 |
Correct |
1 ms |
364 KB |
Output is correct |
11 |
Correct |
1 ms |
364 KB |
Output is correct |
12 |
Correct |
1 ms |
364 KB |
Output is correct |
13 |
Correct |
1 ms |
364 KB |
Output is correct |
14 |
Correct |
1 ms |
364 KB |
Output is correct |
15 |
Correct |
1 ms |
364 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
492 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
1 ms |
364 KB |
Output is correct |
5 |
Correct |
1 ms |
364 KB |
Output is correct |
6 |
Correct |
1 ms |
396 KB |
Output is correct |
7 |
Correct |
1 ms |
364 KB |
Output is correct |
8 |
Correct |
1 ms |
364 KB |
Output is correct |
9 |
Correct |
1 ms |
364 KB |
Output is correct |
10 |
Correct |
1 ms |
364 KB |
Output is correct |
11 |
Correct |
1 ms |
364 KB |
Output is correct |
12 |
Correct |
1 ms |
364 KB |
Output is correct |
13 |
Correct |
1 ms |
364 KB |
Output is correct |
14 |
Correct |
1 ms |
364 KB |
Output is correct |
15 |
Correct |
1 ms |
364 KB |
Output is correct |
16 |
Correct |
22 ms |
2156 KB |
Output is correct |
17 |
Correct |
22 ms |
2156 KB |
Output is correct |
18 |
Correct |
22 ms |
2156 KB |
Output is correct |
19 |
Correct |
22 ms |
2304 KB |
Output is correct |
20 |
Correct |
22 ms |
2156 KB |
Output is correct |
21 |
Correct |
22 ms |
2156 KB |
Output is correct |
22 |
Correct |
26 ms |
2156 KB |
Output is correct |
23 |
Correct |
22 ms |
2276 KB |
Output is correct |
24 |
Correct |
22 ms |
2156 KB |
Output is correct |