| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 260061 |
2020-08-09T07:25:56 Z |
Bill_00 |
Stove (JOI18_stove) |
C++14 |
|
84 ms |
2168 KB |
#include <bits/stdc++.h>
using namespace std;
int a[1000001],b[100001];
int main(){
int n,k;
cin >> n >> k;
for(int i=1;i<=n;i++){
cin >> a[i];
if(i>1) b[i]=a[i]-a[i-1];
}
int niit=a[n]-a[1];
if(k==1){
cout << niit+1;
return 0;
}
int sum=0;
sort(b+2,b+n+1);
for(int i=n;i>=n-k+2;i--){
sum+=b[i];
}
cout << niit-sum+k;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Correct |
1 ms |
384 KB |
Output is correct |
| 3 |
Correct |
0 ms |
384 KB |
Output is correct |
| 4 |
Correct |
0 ms |
384 KB |
Output is correct |
| 5 |
Correct |
0 ms |
384 KB |
Output is correct |
| 6 |
Correct |
0 ms |
384 KB |
Output is correct |
| 7 |
Correct |
1 ms |
384 KB |
Output is correct |
| 8 |
Correct |
1 ms |
376 KB |
Output is correct |
| 9 |
Correct |
0 ms |
384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Correct |
1 ms |
384 KB |
Output is correct |
| 3 |
Correct |
0 ms |
384 KB |
Output is correct |
| 4 |
Correct |
0 ms |
384 KB |
Output is correct |
| 5 |
Correct |
0 ms |
384 KB |
Output is correct |
| 6 |
Correct |
0 ms |
384 KB |
Output is correct |
| 7 |
Correct |
1 ms |
384 KB |
Output is correct |
| 8 |
Correct |
1 ms |
376 KB |
Output is correct |
| 9 |
Correct |
0 ms |
384 KB |
Output is correct |
| 10 |
Correct |
3 ms |
384 KB |
Output is correct |
| 11 |
Correct |
3 ms |
384 KB |
Output is correct |
| 12 |
Correct |
3 ms |
384 KB |
Output is correct |
| 13 |
Correct |
3 ms |
384 KB |
Output is correct |
| 14 |
Correct |
2 ms |
512 KB |
Output is correct |
| 15 |
Correct |
2 ms |
384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Correct |
1 ms |
384 KB |
Output is correct |
| 3 |
Correct |
0 ms |
384 KB |
Output is correct |
| 4 |
Correct |
0 ms |
384 KB |
Output is correct |
| 5 |
Correct |
0 ms |
384 KB |
Output is correct |
| 6 |
Correct |
0 ms |
384 KB |
Output is correct |
| 7 |
Correct |
1 ms |
384 KB |
Output is correct |
| 8 |
Correct |
1 ms |
376 KB |
Output is correct |
| 9 |
Correct |
0 ms |
384 KB |
Output is correct |
| 10 |
Correct |
3 ms |
384 KB |
Output is correct |
| 11 |
Correct |
3 ms |
384 KB |
Output is correct |
| 12 |
Correct |
3 ms |
384 KB |
Output is correct |
| 13 |
Correct |
3 ms |
384 KB |
Output is correct |
| 14 |
Correct |
2 ms |
512 KB |
Output is correct |
| 15 |
Correct |
2 ms |
384 KB |
Output is correct |
| 16 |
Correct |
71 ms |
2040 KB |
Output is correct |
| 17 |
Correct |
84 ms |
2044 KB |
Output is correct |
| 18 |
Correct |
71 ms |
2040 KB |
Output is correct |
| 19 |
Correct |
72 ms |
2072 KB |
Output is correct |
| 20 |
Correct |
76 ms |
2040 KB |
Output is correct |
| 21 |
Correct |
70 ms |
2040 KB |
Output is correct |
| 22 |
Correct |
73 ms |
2168 KB |
Output is correct |
| 23 |
Correct |
75 ms |
2040 KB |
Output is correct |
| 24 |
Correct |
75 ms |
2040 KB |
Output is correct |
