| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 899314 |
2024-01-05T18:23:28 Z |
joccccca |
Stove (JOI18_stove) |
C++14 |
|
35 ms |
3900 KB |
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main()
{
int n, k;
cin >> n >> k;
int a[n], b[n-1];
for(int i=0; i < n; i++)cin>>a[i];
for(int i=0; i < n-1; i++)b[i]=a[i]+1;
vector<int> raz;
for(int i=1; i < n; i++){
raz.push_back(a[i]-b[i-1]);
}
sort(raz.rbegin(),raz.rend());
int mx=a[n-1]+1-a[0];
int mn=k;
if(k==1)cout<<mx;
else if(k==n)cout<<mn;
else{
int br=k-1;
int x=0;
for(int i=0; i < br; i++){
x+=raz[i];
}
cout<<mx-x;
}
}
| # |
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 |
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 |
440 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
436 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 |
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 |
440 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
436 KB |
Output is correct |
| 10 |
Correct |
2 ms |
344 KB |
Output is correct |
| 11 |
Correct |
1 ms |
348 KB |
Output is correct |
| 12 |
Correct |
2 ms |
348 KB |
Output is correct |
| 13 |
Correct |
1 ms |
604 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 |
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 |
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 |
440 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
436 KB |
Output is correct |
| 10 |
Correct |
2 ms |
344 KB |
Output is correct |
| 11 |
Correct |
1 ms |
348 KB |
Output is correct |
| 12 |
Correct |
2 ms |
348 KB |
Output is correct |
| 13 |
Correct |
1 ms |
604 KB |
Output is correct |
| 14 |
Correct |
1 ms |
348 KB |
Output is correct |
| 15 |
Correct |
1 ms |
348 KB |
Output is correct |
| 16 |
Correct |
35 ms |
3796 KB |
Output is correct |
| 17 |
Correct |
35 ms |
3900 KB |
Output is correct |
| 18 |
Correct |
35 ms |
3788 KB |
Output is correct |
| 19 |
Correct |
35 ms |
3772 KB |
Output is correct |
| 20 |
Correct |
35 ms |
3784 KB |
Output is correct |
| 21 |
Correct |
35 ms |
3796 KB |
Output is correct |
| 22 |
Correct |
35 ms |
3788 KB |
Output is correct |
| 23 |
Correct |
35 ms |
3784 KB |
Output is correct |
| 24 |
Correct |
35 ms |
3796 KB |
Output is correct |
