| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 645190 |
2022-09-26T11:53:04 Z |
lucky_c25 |
Stove (JOI18_stove) |
C++14 |
|
63 ms |
2212 KB |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
int n,k; cin>>n>>k;
vector<int> a(n),razlike;
cin>>a[0];
int spojene = 0;
for(int i = 1;i<n;i++){
cin>>a[i];
if(a[i] == a[i-1]+1)
spojene++;
else if(a[i] > a[i-1]+1){
razlike.push_back(a[i] - a[i-1]-1);
}
}
sort(razlike.begin(),razlike.end());
int m = n-spojene;
//cout<<m-k<<"\n";
if(m<=k) cout<<n<<endl;
else{
for(int i = 0;i<m-k;i++){
n+=razlike[i];
}
cout<<n<<endl;
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
300 KB |
Output is correct |
| 5 |
Correct |
0 ms |
300 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
0 ms |
212 KB |
Output is correct |
| 8 |
Correct |
0 ms |
212 KB |
Output is correct |
| 9 |
Correct |
0 ms |
212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
300 KB |
Output is correct |
| 5 |
Correct |
0 ms |
300 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
0 ms |
212 KB |
Output is correct |
| 8 |
Correct |
0 ms |
212 KB |
Output is correct |
| 9 |
Correct |
0 ms |
212 KB |
Output is correct |
| 10 |
Correct |
2 ms |
340 KB |
Output is correct |
| 11 |
Correct |
2 ms |
308 KB |
Output is correct |
| 12 |
Correct |
2 ms |
340 KB |
Output is correct |
| 13 |
Correct |
2 ms |
340 KB |
Output is correct |
| 14 |
Correct |
2 ms |
340 KB |
Output is correct |
| 15 |
Correct |
2 ms |
340 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
300 KB |
Output is correct |
| 5 |
Correct |
0 ms |
300 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
0 ms |
212 KB |
Output is correct |
| 8 |
Correct |
0 ms |
212 KB |
Output is correct |
| 9 |
Correct |
0 ms |
212 KB |
Output is correct |
| 10 |
Correct |
2 ms |
340 KB |
Output is correct |
| 11 |
Correct |
2 ms |
308 KB |
Output is correct |
| 12 |
Correct |
2 ms |
340 KB |
Output is correct |
| 13 |
Correct |
2 ms |
340 KB |
Output is correct |
| 14 |
Correct |
2 ms |
340 KB |
Output is correct |
| 15 |
Correct |
2 ms |
340 KB |
Output is correct |
| 16 |
Correct |
47 ms |
2112 KB |
Output is correct |
| 17 |
Correct |
46 ms |
2128 KB |
Output is correct |
| 18 |
Correct |
46 ms |
2144 KB |
Output is correct |
| 19 |
Correct |
48 ms |
2200 KB |
Output is correct |
| 20 |
Correct |
63 ms |
2180 KB |
Output is correct |
| 21 |
Correct |
50 ms |
2084 KB |
Output is correct |
| 22 |
Correct |
45 ms |
2164 KB |
Output is correct |
| 23 |
Correct |
46 ms |
2120 KB |
Output is correct |
| 24 |
Correct |
48 ms |
2212 KB |
Output is correct |
