| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1049853 |
2024-08-09T05:46:41 Z |
vjudge1 |
Stove (JOI18_stove) |
C++17 |
|
25 ms |
3160 KB |
#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long long mas[n], df[n-1], sm=0;
for(int i=0; i<n; i++){
cin >> mas[i];
if(i>0){
df[i-1]=mas[i]-mas[i-1]-1;
}
}
sort(df, df+n-1);
for(int i=0; i<n-k; i++){
sm+=df[i];
}
cout <<sm+n;
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 |
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 |
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 |
348 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 |
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 |
348 KB |
Output is correct |
| 12 |
Correct |
1 ms |
344 KB |
Output is correct |
| 13 |
Correct |
1 ms |
348 KB |
Output is correct |
| 14 |
Correct |
1 ms |
444 KB |
Output is correct |
| 15 |
Correct |
1 ms |
444 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 |
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 |
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 |
348 KB |
Output is correct |
| 12 |
Correct |
1 ms |
344 KB |
Output is correct |
| 13 |
Correct |
1 ms |
348 KB |
Output is correct |
| 14 |
Correct |
1 ms |
444 KB |
Output is correct |
| 15 |
Correct |
1 ms |
444 KB |
Output is correct |
| 16 |
Correct |
25 ms |
2904 KB |
Output is correct |
| 17 |
Correct |
25 ms |
2908 KB |
Output is correct |
| 18 |
Correct |
24 ms |
2872 KB |
Output is correct |
| 19 |
Correct |
24 ms |
3160 KB |
Output is correct |
| 20 |
Correct |
24 ms |
2908 KB |
Output is correct |
| 21 |
Correct |
24 ms |
2904 KB |
Output is correct |
| 22 |
Correct |
24 ms |
2740 KB |
Output is correct |
| 23 |
Correct |
24 ms |
2936 KB |
Output is correct |
| 24 |
Correct |
24 ms |
2960 KB |
Output is correct |
