# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
946875 |
2024-03-15T07:06:20 Z |
tnknguyen_ |
Stove (JOI18_stove) |
C++17 |
|
19 ms |
4704 KB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
const int sz = 1e6 + 5;
long long a[sz];
int n, k;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
//freopen("main.inp","r",stdin);
//freopen("main.out","w",stdout);
cin >> n >> k;
if(k == n){
cout << n;
return 0;
}
vector<int> v;
for(int i=1;i<=n;++i){
cin >> a[i];
if(i > 1){
v.push_back(a[i] - a[i-1] - 1);
}
}
sort(v.begin(), v.end(), greater<int>());
long long ans = a[n] - a[1] + 1;
for(int i=0;i<k-1;++i){
ans -= (v[i]);
}
cout << ans;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
344 KB |
Output is correct |
10 |
Correct |
1 ms |
344 KB |
Output is correct |
11 |
Correct |
1 ms |
348 KB |
Output is correct |
12 |
Correct |
1 ms |
348 KB |
Output is correct |
13 |
Correct |
1 ms |
348 KB |
Output is correct |
14 |
Correct |
1 ms |
348 KB |
Output is correct |
15 |
Correct |
1 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
344 KB |
Output is correct |
10 |
Correct |
1 ms |
344 KB |
Output is correct |
11 |
Correct |
1 ms |
348 KB |
Output is correct |
12 |
Correct |
1 ms |
348 KB |
Output is correct |
13 |
Correct |
1 ms |
348 KB |
Output is correct |
14 |
Correct |
1 ms |
348 KB |
Output is correct |
15 |
Correct |
1 ms |
344 KB |
Output is correct |
16 |
Correct |
15 ms |
4572 KB |
Output is correct |
17 |
Correct |
15 ms |
4572 KB |
Output is correct |
18 |
Correct |
15 ms |
4544 KB |
Output is correct |
19 |
Correct |
15 ms |
4596 KB |
Output is correct |
20 |
Correct |
16 ms |
4528 KB |
Output is correct |
21 |
Correct |
15 ms |
4572 KB |
Output is correct |
22 |
Correct |
15 ms |
4704 KB |
Output is correct |
23 |
Correct |
14 ms |
4572 KB |
Output is correct |
24 |
Correct |
19 ms |
4596 KB |
Output is correct |