| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 530673 |
2022-02-26T11:34:11 Z |
Gurban |
Stove (JOI18_stove) |
C++17 |
|
48 ms |
2740 KB |
#include <iostream>
#include <algorithm>
#define ll long long int
using namespace std;
ll n,k,ans,a[100001];
vector<int>v;
int main(){
cin>>n>>k;
for(int i=1;i<=n;i++) cin>>a[i];
if(k>=n) cout<<n<<endl;
else{
for(int i=2;i<=n;i++){
v.push_back(a[i] - a[i-1] - 1);
}
sort(v.begin(),v.end());
for(int i=0;i<n-k;i++) ans+=v[i];
cout<<ans+n<<endl;
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
1 ms |
204 KB |
Output is correct |
| 4 |
Correct |
0 ms |
204 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
204 KB |
Output is correct |
| 7 |
Correct |
0 ms |
304 KB |
Output is correct |
| 8 |
Correct |
0 ms |
204 KB |
Output is correct |
| 9 |
Correct |
0 ms |
204 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
1 ms |
204 KB |
Output is correct |
| 4 |
Correct |
0 ms |
204 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
204 KB |
Output is correct |
| 7 |
Correct |
0 ms |
304 KB |
Output is correct |
| 8 |
Correct |
0 ms |
204 KB |
Output is correct |
| 9 |
Correct |
0 ms |
204 KB |
Output is correct |
| 10 |
Correct |
2 ms |
332 KB |
Output is correct |
| 11 |
Correct |
2 ms |
332 KB |
Output is correct |
| 12 |
Correct |
2 ms |
332 KB |
Output is correct |
| 13 |
Correct |
2 ms |
332 KB |
Output is correct |
| 14 |
Correct |
2 ms |
332 KB |
Output is correct |
| 15 |
Correct |
2 ms |
312 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
1 ms |
204 KB |
Output is correct |
| 4 |
Correct |
0 ms |
204 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
204 KB |
Output is correct |
| 7 |
Correct |
0 ms |
304 KB |
Output is correct |
| 8 |
Correct |
0 ms |
204 KB |
Output is correct |
| 9 |
Correct |
0 ms |
204 KB |
Output is correct |
| 10 |
Correct |
2 ms |
332 KB |
Output is correct |
| 11 |
Correct |
2 ms |
332 KB |
Output is correct |
| 12 |
Correct |
2 ms |
332 KB |
Output is correct |
| 13 |
Correct |
2 ms |
332 KB |
Output is correct |
| 14 |
Correct |
2 ms |
332 KB |
Output is correct |
| 15 |
Correct |
2 ms |
312 KB |
Output is correct |
| 16 |
Correct |
41 ms |
2660 KB |
Output is correct |
| 17 |
Correct |
43 ms |
2712 KB |
Output is correct |
| 18 |
Correct |
42 ms |
2648 KB |
Output is correct |
| 19 |
Correct |
42 ms |
2612 KB |
Output is correct |
| 20 |
Correct |
42 ms |
2556 KB |
Output is correct |
| 21 |
Correct |
46 ms |
2640 KB |
Output is correct |
| 22 |
Correct |
42 ms |
2656 KB |
Output is correct |
| 23 |
Correct |
48 ms |
2636 KB |
Output is correct |
| 24 |
Correct |
43 ms |
2740 KB |
Output is correct |
