# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1099191 |
2024-10-10T17:15:18 Z |
Yusif_27 |
Stove (JOI18_stove) |
C++14 |
|
36 ms |
3324 KB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll n,k;
cin>>n>>k;
vector<ll>v(n);
for (ll i=0;i<n;i++){
cin>>v[i];
}
vector<ll>T;
for(ll i=0;i<n-1;i++){
T.push_back(v[i+1]-v[i]-1);
}
sort(T.begin(),T.end());
reverse(T.begin(),T.end());
ll ans=v[n-1]-v[0]+1;
for (ll i=0;i<k-1;i++){
ans-=T[i];
}
cout<<ans<<endl;
return 0;
}
# |
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 |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 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 |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
2 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 |
1 ms |
348 KB |
Output is correct |
15 |
Correct |
2 ms |
344 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 |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
2 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 |
1 ms |
348 KB |
Output is correct |
15 |
Correct |
2 ms |
344 KB |
Output is correct |
16 |
Correct |
35 ms |
3324 KB |
Output is correct |
17 |
Correct |
30 ms |
3280 KB |
Output is correct |
18 |
Correct |
35 ms |
3248 KB |
Output is correct |
19 |
Correct |
31 ms |
3244 KB |
Output is correct |
20 |
Correct |
31 ms |
3284 KB |
Output is correct |
21 |
Correct |
36 ms |
3272 KB |
Output is correct |
22 |
Correct |
31 ms |
3272 KB |
Output is correct |
23 |
Correct |
31 ms |
3272 KB |
Output is correct |
24 |
Correct |
31 ms |
3276 KB |
Output is correct |