# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1002341 |
2024-06-19T12:58:17 Z |
ocasu |
Stove (JOI18_stove) |
C++17 |
|
39 ms |
2964 KB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n,k; cin>>n>>k;
vector<int> t(n);
for (int i=0; i<n; i++){
cin>>t[i];
}
vector<int> a(n-1);
for (int i=0; i<n-1; i++){
a[i]=t[i+1]-t[i];
}
sort(a.begin(),a.end());
int ans=n;
if (n>k){
for (int i=0; i<n-k; i++){
ans+=a[i]-1;
}
}
cout<<ans<<'\n';
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 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 |
0 ms |
348 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 |
0 ms |
440 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 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 |
0 ms |
348 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 |
0 ms |
440 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
344 KB |
Output is correct |
11 |
Correct |
1 ms |
344 KB |
Output is correct |
12 |
Correct |
1 ms |
348 KB |
Output is correct |
13 |
Correct |
1 ms |
492 KB |
Output is correct |
14 |
Correct |
1 ms |
348 KB |
Output is correct |
15 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 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 |
0 ms |
348 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 |
0 ms |
440 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
344 KB |
Output is correct |
11 |
Correct |
1 ms |
344 KB |
Output is correct |
12 |
Correct |
1 ms |
348 KB |
Output is correct |
13 |
Correct |
1 ms |
492 KB |
Output is correct |
14 |
Correct |
1 ms |
348 KB |
Output is correct |
15 |
Correct |
1 ms |
348 KB |
Output is correct |
16 |
Correct |
32 ms |
2904 KB |
Output is correct |
17 |
Correct |
35 ms |
2744 KB |
Output is correct |
18 |
Correct |
28 ms |
2904 KB |
Output is correct |
19 |
Correct |
31 ms |
2964 KB |
Output is correct |
20 |
Correct |
32 ms |
2900 KB |
Output is correct |
21 |
Correct |
29 ms |
2956 KB |
Output is correct |
22 |
Correct |
30 ms |
2952 KB |
Output is correct |
23 |
Correct |
39 ms |
2900 KB |
Output is correct |
24 |
Correct |
30 ms |
2864 KB |
Output is correct |