| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 868952 |
2023-11-02T13:43:40 Z |
F_Universe |
Stove (JOI18_stove) |
C++14 |
|
39 ms |
2464 KB |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin >>n >>k;
int x[n];
int y[n];
int sum=0;
y[0]=0;
for(int i=0;i<n;i++){
cin >>x[i];
}
for(int i=1;i<n;i++){
y[i]=x[i]-x[i-1];
}
sort(y,y+n);
for(int i=0;i<n-k+1;i++){
sum=sum+y[i];
}
printf("%d",sum+k);
}
| # |
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 |
344 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 |
436 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 |
344 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 |
436 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
2 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 |
420 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 |
344 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 |
436 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
2 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 |
420 KB |
Output is correct |
| 16 |
Correct |
39 ms |
2324 KB |
Output is correct |
| 17 |
Correct |
35 ms |
2136 KB |
Output is correct |
| 18 |
Correct |
34 ms |
1936 KB |
Output is correct |
| 19 |
Correct |
33 ms |
2144 KB |
Output is correct |
| 20 |
Correct |
33 ms |
2140 KB |
Output is correct |
| 21 |
Correct |
33 ms |
2128 KB |
Output is correct |
| 22 |
Correct |
32 ms |
2084 KB |
Output is correct |
| 23 |
Correct |
33 ms |
2132 KB |
Output is correct |
| 24 |
Correct |
35 ms |
2464 KB |
Output is correct |
