# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
678036 |
2023-01-05T04:58:03 Z |
vjudge1 |
Stove (JOI18_stove) |
C++17 |
|
45 ms |
2876 KB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[100005];
void solve() {
ll n, k;
cin >> n >> k;
for(int i = 1; i <= n; i++) {
cin >> a[i];
}
vector <ll> v;
for(int i = 2; i <= n; i++) {
v.push_back(a[i] - a[i - 1] - 1);
}
sort(v.begin(), v.end());
ll sum = n;
for(int i = 0; i < n - k; i++) {
sum += v[i];
}
cout << sum << '\n';
}
int main() {
//freopen("success.in", "r", stdin);
//freopen("success.out", "w", stdout);
ll t = 1;
//cin >> t;
while(t--) {
solve();
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
316 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
316 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
2 ms |
360 KB |
Output is correct |
11 |
Correct |
2 ms |
328 KB |
Output is correct |
12 |
Correct |
2 ms |
340 KB |
Output is correct |
13 |
Correct |
2 ms |
340 KB |
Output is correct |
14 |
Correct |
2 ms |
348 KB |
Output is correct |
15 |
Correct |
2 ms |
328 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
316 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
2 ms |
360 KB |
Output is correct |
11 |
Correct |
2 ms |
328 KB |
Output is correct |
12 |
Correct |
2 ms |
340 KB |
Output is correct |
13 |
Correct |
2 ms |
340 KB |
Output is correct |
14 |
Correct |
2 ms |
348 KB |
Output is correct |
15 |
Correct |
2 ms |
328 KB |
Output is correct |
16 |
Correct |
43 ms |
2756 KB |
Output is correct |
17 |
Correct |
42 ms |
2796 KB |
Output is correct |
18 |
Correct |
42 ms |
2776 KB |
Output is correct |
19 |
Correct |
43 ms |
2756 KB |
Output is correct |
20 |
Correct |
44 ms |
2876 KB |
Output is correct |
21 |
Correct |
44 ms |
2848 KB |
Output is correct |
22 |
Correct |
42 ms |
2776 KB |
Output is correct |
23 |
Correct |
43 ms |
2780 KB |
Output is correct |
24 |
Correct |
45 ms |
2808 KB |
Output is correct |