| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 951953 |
2024-03-23T02:39:34 Z |
SaMuEl0516 |
Stove (JOI18_stove) |
C++17 |
|
21 ms |
2328 KB |
#include<bits/stdc++.h>
using namespace std;
vector<int>v;
int t[(int)1e5+5];
int main(){
cin.tie(0)->sync_with_stdio(0);
int n,k;
cin>>n>>k;
for(int i=0;i<n;i++){
cin>>t[i];
if(i)v.push_back(t[i]-t[i-1]-1);
}
sort(v.begin(),v.end(),greater<int>());
int sum=0;
for(int i=0;i<k-1;i++)sum+=v[i];
cout<<t[n-1]+1-t[0]-sum;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
460 KB |
Output is correct |
| 2 |
Correct |
1 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 |
0 ms |
460 KB |
Output is correct |
| 2 |
Correct |
1 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 |
1 ms |
348 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 |
348 KB |
Output is correct |
| 14 |
Correct |
1 ms |
344 KB |
Output is correct |
| 15 |
Correct |
1 ms |
480 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
460 KB |
Output is correct |
| 2 |
Correct |
1 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 |
1 ms |
348 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 |
348 KB |
Output is correct |
| 14 |
Correct |
1 ms |
344 KB |
Output is correct |
| 15 |
Correct |
1 ms |
480 KB |
Output is correct |
| 16 |
Correct |
14 ms |
2268 KB |
Output is correct |
| 17 |
Correct |
15 ms |
2152 KB |
Output is correct |
| 18 |
Correct |
15 ms |
2328 KB |
Output is correct |
| 19 |
Correct |
20 ms |
2268 KB |
Output is correct |
| 20 |
Correct |
21 ms |
2268 KB |
Output is correct |
| 21 |
Correct |
16 ms |
2268 KB |
Output is correct |
| 22 |
Correct |
16 ms |
2164 KB |
Output is correct |
| 23 |
Correct |
14 ms |
2144 KB |
Output is correct |
| 24 |
Correct |
15 ms |
2268 KB |
Output is correct |
