| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 41069 |
2018-02-12T10:51:46 Z |
kdh9949 |
Stove (JOI18_stove) |
C++14 |
|
24 ms |
1096 KB |
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n, k, a[N], r;
int main(){
ios_base::sync_with_stdio(false); cin.tie(NULL);
cin >> n >> k;
for(int i = 0; i < n; i++) cin >> a[i];
r = a[n - 1] - a[0] + 1;
adjacent_difference(a, a + n, a);
sort(a + 1, a + n, greater<int>());
for(int i = 1; i < k; i++) r -= (a[i] - 1);
cout << r << endl;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
248 KB |
Output is correct |
| 2 |
Correct |
2 ms |
352 KB |
Output is correct |
| 3 |
Correct |
2 ms |
424 KB |
Output is correct |
| 4 |
Correct |
2 ms |
540 KB |
Output is correct |
| 5 |
Correct |
2 ms |
568 KB |
Output is correct |
| 6 |
Correct |
2 ms |
568 KB |
Output is correct |
| 7 |
Correct |
2 ms |
568 KB |
Output is correct |
| 8 |
Correct |
2 ms |
568 KB |
Output is correct |
| 9 |
Correct |
2 ms |
696 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
248 KB |
Output is correct |
| 2 |
Correct |
2 ms |
352 KB |
Output is correct |
| 3 |
Correct |
2 ms |
424 KB |
Output is correct |
| 4 |
Correct |
2 ms |
540 KB |
Output is correct |
| 5 |
Correct |
2 ms |
568 KB |
Output is correct |
| 6 |
Correct |
2 ms |
568 KB |
Output is correct |
| 7 |
Correct |
2 ms |
568 KB |
Output is correct |
| 8 |
Correct |
2 ms |
568 KB |
Output is correct |
| 9 |
Correct |
2 ms |
696 KB |
Output is correct |
| 10 |
Correct |
2 ms |
696 KB |
Output is correct |
| 11 |
Correct |
2 ms |
696 KB |
Output is correct |
| 12 |
Correct |
2 ms |
696 KB |
Output is correct |
| 13 |
Correct |
2 ms |
696 KB |
Output is correct |
| 14 |
Correct |
2 ms |
696 KB |
Output is correct |
| 15 |
Correct |
2 ms |
696 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
248 KB |
Output is correct |
| 2 |
Correct |
2 ms |
352 KB |
Output is correct |
| 3 |
Correct |
2 ms |
424 KB |
Output is correct |
| 4 |
Correct |
2 ms |
540 KB |
Output is correct |
| 5 |
Correct |
2 ms |
568 KB |
Output is correct |
| 6 |
Correct |
2 ms |
568 KB |
Output is correct |
| 7 |
Correct |
2 ms |
568 KB |
Output is correct |
| 8 |
Correct |
2 ms |
568 KB |
Output is correct |
| 9 |
Correct |
2 ms |
696 KB |
Output is correct |
| 10 |
Correct |
2 ms |
696 KB |
Output is correct |
| 11 |
Correct |
2 ms |
696 KB |
Output is correct |
| 12 |
Correct |
2 ms |
696 KB |
Output is correct |
| 13 |
Correct |
2 ms |
696 KB |
Output is correct |
| 14 |
Correct |
2 ms |
696 KB |
Output is correct |
| 15 |
Correct |
2 ms |
696 KB |
Output is correct |
| 16 |
Correct |
23 ms |
988 KB |
Output is correct |
| 17 |
Correct |
22 ms |
988 KB |
Output is correct |
| 18 |
Correct |
22 ms |
988 KB |
Output is correct |
| 19 |
Correct |
22 ms |
1096 KB |
Output is correct |
| 20 |
Correct |
22 ms |
1096 KB |
Output is correct |
| 21 |
Correct |
22 ms |
1096 KB |
Output is correct |
| 22 |
Correct |
22 ms |
1096 KB |
Output is correct |
| 23 |
Correct |
24 ms |
1096 KB |
Output is correct |
| 24 |
Correct |
22 ms |
1096 KB |
Output is correct |
