| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 941223 |
2024-03-08T09:54:26 Z |
freedommo33 |
Stove (JOI18_stove) |
C++17 |
|
20 ms |
2292 KB |
#include <bits/stdc++.h>
using namespace std;
constexpr int M = 100005;
int tab[M];
bool czy(int a, int b){ return b<a; }
int main(){
cin.tie(0)->sync_with_stdio(0);
int n, k;
cin>>n>>k;
for(int i=1; i<=n; i++) cin>>tab[i];
vector<int> przerwy;
for(int i=n; i>1; i--){
przerwy.push_back(tab[i]-tab[i-1]-1);
}
sort(przerwy.begin(), przerwy.end(), czy);
int ile = 0;
for(int i=1; i<=k-1; i++) ile+=przerwy[i-1];
cout<<tab[n] - tab[1] + 1 - ile<<endl;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
464 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 |
344 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 |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
464 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 |
344 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 |
348 KB |
Output is correct |
| 12 |
Correct |
1 ms |
348 KB |
Output is correct |
| 13 |
Correct |
1 ms |
600 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 |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
464 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 |
344 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 |
348 KB |
Output is correct |
| 12 |
Correct |
1 ms |
348 KB |
Output is correct |
| 13 |
Correct |
1 ms |
600 KB |
Output is correct |
| 14 |
Correct |
1 ms |
348 KB |
Output is correct |
| 15 |
Correct |
1 ms |
348 KB |
Output is correct |
| 16 |
Correct |
16 ms |
2272 KB |
Output is correct |
| 17 |
Correct |
17 ms |
2268 KB |
Output is correct |
| 18 |
Correct |
16 ms |
2272 KB |
Output is correct |
| 19 |
Correct |
16 ms |
2272 KB |
Output is correct |
| 20 |
Correct |
17 ms |
2272 KB |
Output is correct |
| 21 |
Correct |
16 ms |
2268 KB |
Output is correct |
| 22 |
Correct |
16 ms |
2272 KB |
Output is correct |
| 23 |
Correct |
20 ms |
2292 KB |
Output is correct |
| 24 |
Correct |
17 ms |
2288 KB |
Output is correct |
