# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1034839 |
2024-07-25T19:37:51 Z |
DeathIsAwe |
Stove (JOI18_stove) |
C++14 |
|
44 ms |
2356 KB |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,k; cin >> n >> k; k--;
vector<int> times(n),timediffs;
for (int i=0;i<n;i++) {
cin >> times[i];
}
sort(times.begin(),times.end());
for (int i=0;i<n-1;i++) {
timediffs.push_back(times[i+1]-times[i]);
}
int ans = times[n-1] - times[0] + 1;
sort(timediffs.begin(),timediffs.end(),greater<int>());
for (int i=0;i<k;i++) {
ans -= (timediffs[i]-1);
}
cout << ans;
}
# |
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 |
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 |
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 |
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 |
344 KB |
Output is correct |
12 |
Correct |
1 ms |
348 KB |
Output is correct |
13 |
Correct |
1 ms |
348 KB |
Output is correct |
14 |
Correct |
1 ms |
392 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 |
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 |
344 KB |
Output is correct |
12 |
Correct |
1 ms |
348 KB |
Output is correct |
13 |
Correct |
1 ms |
348 KB |
Output is correct |
14 |
Correct |
1 ms |
392 KB |
Output is correct |
15 |
Correct |
1 ms |
348 KB |
Output is correct |
16 |
Correct |
44 ms |
2356 KB |
Output is correct |
17 |
Correct |
33 ms |
2344 KB |
Output is correct |
18 |
Correct |
32 ms |
2252 KB |
Output is correct |
19 |
Correct |
30 ms |
2264 KB |
Output is correct |
20 |
Correct |
30 ms |
2264 KB |
Output is correct |
21 |
Correct |
30 ms |
2300 KB |
Output is correct |
22 |
Correct |
30 ms |
2264 KB |
Output is correct |
23 |
Correct |
30 ms |
2328 KB |
Output is correct |
24 |
Correct |
30 ms |
2252 KB |
Output is correct |