# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
978261 |
2024-05-09T05:00:27 Z |
TiChaLaLaLa |
Stove (JOI18_stove) |
C++17 |
|
41 ms |
1884 KB |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
long long int t[n];
long long int btw[n-1];
cin >> t[0];
for(int i=1;i<n;i++){
cin >> t[i];
btw[i-1] = t[i]-t[i-1]-1;
}
sort(btw,btw+n-1,greater<>());
long long int time=t[n-1]-t[0]+1;
int match = 0;
while(match<k-1){
time-=btw[match];
match++;
}
cout << time;
}
# |
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 |
344 KB |
Output is correct |
5 |
Correct |
1 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 |
344 KB |
Output is correct |
5 |
Correct |
1 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 |
348 KB |
Output is correct |
13 |
Correct |
1 ms |
348 KB |
Output is correct |
14 |
Correct |
2 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 |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
344 KB |
Output is correct |
5 |
Correct |
1 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 |
348 KB |
Output is correct |
13 |
Correct |
1 ms |
348 KB |
Output is correct |
14 |
Correct |
2 ms |
348 KB |
Output is correct |
15 |
Correct |
1 ms |
348 KB |
Output is correct |
16 |
Correct |
33 ms |
1884 KB |
Output is correct |
17 |
Correct |
33 ms |
1884 KB |
Output is correct |
18 |
Correct |
33 ms |
1880 KB |
Output is correct |
19 |
Correct |
33 ms |
1884 KB |
Output is correct |
20 |
Correct |
33 ms |
1880 KB |
Output is correct |
21 |
Correct |
40 ms |
1884 KB |
Output is correct |
22 |
Correct |
41 ms |
1884 KB |
Output is correct |
23 |
Correct |
35 ms |
1884 KB |
Output is correct |
24 |
Correct |
33 ms |
1884 KB |
Output is correct |