# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
330113 |
2020-11-24T02:45:40 Z |
casperwang |
Stove (JOI18_stove) |
C++14 |
|
24 ms |
2416 KB |
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
const int MAXN = 100000;
int n, k;
int a[MAXN+1];
vector <int> d;
int ans;
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0);
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a+n);
for (int i = 1; i < n; i++)
d.pb(a[i] - a[i-1] - 1);
sort(d.begin(), d.end(), greater<int>());
ans = a[n-1] - a[0] + 1;
for (int i = 0; i < k-1; i++) {
ans -= d[i];
}
cout << ans << "\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
384 KB |
Output is correct |
3 |
Correct |
0 ms |
364 KB |
Output is correct |
4 |
Correct |
1 ms |
364 KB |
Output is correct |
5 |
Correct |
1 ms |
384 KB |
Output is correct |
6 |
Correct |
1 ms |
364 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 |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
384 KB |
Output is correct |
3 |
Correct |
0 ms |
364 KB |
Output is correct |
4 |
Correct |
1 ms |
364 KB |
Output is correct |
5 |
Correct |
1 ms |
384 KB |
Output is correct |
6 |
Correct |
1 ms |
364 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 |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
384 KB |
Output is correct |
3 |
Correct |
0 ms |
364 KB |
Output is correct |
4 |
Correct |
1 ms |
364 KB |
Output is correct |
5 |
Correct |
1 ms |
384 KB |
Output is correct |
6 |
Correct |
1 ms |
364 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 |
384 KB |
Output is correct |
16 |
Correct |
23 ms |
2416 KB |
Output is correct |
17 |
Correct |
23 ms |
2308 KB |
Output is correct |
18 |
Correct |
24 ms |
2288 KB |
Output is correct |
19 |
Correct |
22 ms |
2288 KB |
Output is correct |
20 |
Correct |
23 ms |
2288 KB |
Output is correct |
21 |
Correct |
24 ms |
2308 KB |
Output is correct |
22 |
Correct |
23 ms |
2288 KB |
Output is correct |
23 |
Correct |
24 ms |
2416 KB |
Output is correct |
24 |
Correct |
23 ms |
2288 KB |
Output is correct |