# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1033626 |
2024-07-25T04:06:43 Z |
KhoaDuy |
Stove (JOI18_stove) |
C++14 |
|
15 ms |
2268 KB |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,k;
cin >> n >> k;
int t[n+1];
int ans=0;
for(int i=1;i<=n;i++){
cin >> t[i];
}
ans=t[n]-t[1]+1;
vector<int> curr;
for(int i=1;i<n;i++){
curr.push_back(t[i+1]-t[i]-1);
}
sort(curr.begin(),curr.end(),greater<int>());
for(int i=0;i<k-1;i++){
ans-=curr[i];
}
cout << ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
344 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
344 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 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 |
0 ms |
348 KB |
Output is correct |
15 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
344 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 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 |
0 ms |
348 KB |
Output is correct |
15 |
Correct |
1 ms |
348 KB |
Output is correct |
16 |
Correct |
13 ms |
2268 KB |
Output is correct |
17 |
Correct |
13 ms |
2268 KB |
Output is correct |
18 |
Correct |
14 ms |
2268 KB |
Output is correct |
19 |
Correct |
15 ms |
2268 KB |
Output is correct |
20 |
Correct |
14 ms |
2268 KB |
Output is correct |
21 |
Correct |
14 ms |
2268 KB |
Output is correct |
22 |
Correct |
14 ms |
2268 KB |
Output is correct |
23 |
Correct |
13 ms |
2268 KB |
Output is correct |
24 |
Correct |
14 ms |
2268 KB |
Output is correct |