| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 997496 |
2024-06-12T12:13:10 Z |
vjudge1 |
Stove (JOI18_stove) |
C++17 |
|
41 ms |
2908 KB |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll t = 1;
while(t--) {
ll n, k;
cin >> n >> k;
ll t1[n], s[n - 1];
for (int i = 0;i < n; i++) {
cin >> t1[i];
if (i > 0) {
s[i - 1] = t1[i] - t1[i - 1] - 1;
}
}
sort(s, s + n - 1);
ll sum = n;
for (int i = 0;i < n - k; i++) {
sum += s[i];
}
cout << sum;
}
return 0;
}
| # |
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 |
344 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
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 |
344 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
348 KB |
Output is correct |
| 10 |
Correct |
1 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 |
348 KB |
Output is correct |
| 14 |
Correct |
1 ms |
348 KB |
Output is correct |
| 15 |
Correct |
1 ms |
448 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 |
344 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
348 KB |
Output is correct |
| 10 |
Correct |
1 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 |
348 KB |
Output is correct |
| 14 |
Correct |
1 ms |
348 KB |
Output is correct |
| 15 |
Correct |
1 ms |
448 KB |
Output is correct |
| 16 |
Correct |
30 ms |
2908 KB |
Output is correct |
| 17 |
Correct |
41 ms |
2908 KB |
Output is correct |
| 18 |
Correct |
31 ms |
2864 KB |
Output is correct |
| 19 |
Correct |
31 ms |
2896 KB |
Output is correct |
| 20 |
Correct |
36 ms |
2908 KB |
Output is correct |
| 21 |
Correct |
30 ms |
2868 KB |
Output is correct |
| 22 |
Correct |
30 ms |
2740 KB |
Output is correct |
| 23 |
Correct |
29 ms |
2728 KB |
Output is correct |
| 24 |
Correct |
35 ms |
2908 KB |
Output is correct |
