| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 341629 |
2020-12-30T10:14:15 Z |
BlancaHM |
Stove (JOI18_stove) |
C++14 |
|
23 ms |
2060 KB |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int solve(int K, vector<int> & times) {
int N = (int) times.size();
vector<int> gaps(N-1);
for (int i = 0; i < N-1; i++)
gaps[i] = times[i+1]-times[i]-1;
sort(gaps.begin(), gaps.end(), greater<int>());
int answer = times[N-1]+1 - times[0];
for (int i = 0; i < K-1; i++) {
answer -= gaps[i];
}
return answer;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int N, K;
vector<int> times;
cin >> N >> K;
times = vector<int>(N);
for (int i = 0; i < N; i++)
cin >> times[i];
cout << solve(K, times) << '\n';
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Correct |
1 ms |
364 KB |
Output is correct |
| 3 |
Correct |
1 ms |
364 KB |
Output is correct |
| 4 |
Correct |
1 ms |
364 KB |
Output is correct |
| 5 |
Correct |
1 ms |
364 KB |
Output is correct |
| 6 |
Correct |
1 ms |
364 KB |
Output is correct |
| 7 |
Correct |
1 ms |
364 KB |
Output is correct |
| 8 |
Correct |
1 ms |
364 KB |
Output is correct |
| 9 |
Correct |
1 ms |
364 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Correct |
1 ms |
364 KB |
Output is correct |
| 3 |
Correct |
1 ms |
364 KB |
Output is correct |
| 4 |
Correct |
1 ms |
364 KB |
Output is correct |
| 5 |
Correct |
1 ms |
364 KB |
Output is correct |
| 6 |
Correct |
1 ms |
364 KB |
Output is correct |
| 7 |
Correct |
1 ms |
364 KB |
Output is correct |
| 8 |
Correct |
1 ms |
364 KB |
Output is correct |
| 9 |
Correct |
1 ms |
364 KB |
Output is correct |
| 10 |
Correct |
1 ms |
364 KB |
Output is correct |
| 11 |
Correct |
1 ms |
364 KB |
Output is correct |
| 12 |
Correct |
1 ms |
364 KB |
Output is correct |
| 13 |
Correct |
1 ms |
492 KB |
Output is correct |
| 14 |
Correct |
1 ms |
364 KB |
Output is correct |
| 15 |
Correct |
1 ms |
364 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Correct |
1 ms |
364 KB |
Output is correct |
| 3 |
Correct |
1 ms |
364 KB |
Output is correct |
| 4 |
Correct |
1 ms |
364 KB |
Output is correct |
| 5 |
Correct |
1 ms |
364 KB |
Output is correct |
| 6 |
Correct |
1 ms |
364 KB |
Output is correct |
| 7 |
Correct |
1 ms |
364 KB |
Output is correct |
| 8 |
Correct |
1 ms |
364 KB |
Output is correct |
| 9 |
Correct |
1 ms |
364 KB |
Output is correct |
| 10 |
Correct |
1 ms |
364 KB |
Output is correct |
| 11 |
Correct |
1 ms |
364 KB |
Output is correct |
| 12 |
Correct |
1 ms |
364 KB |
Output is correct |
| 13 |
Correct |
1 ms |
492 KB |
Output is correct |
| 14 |
Correct |
1 ms |
364 KB |
Output is correct |
| 15 |
Correct |
1 ms |
364 KB |
Output is correct |
| 16 |
Correct |
20 ms |
2028 KB |
Output is correct |
| 17 |
Correct |
20 ms |
2028 KB |
Output is correct |
| 18 |
Correct |
20 ms |
2028 KB |
Output is correct |
| 19 |
Correct |
20 ms |
2028 KB |
Output is correct |
| 20 |
Correct |
23 ms |
2028 KB |
Output is correct |
| 21 |
Correct |
22 ms |
2048 KB |
Output is correct |
| 22 |
Correct |
20 ms |
2028 KB |
Output is correct |
| 23 |
Correct |
20 ms |
2060 KB |
Output is correct |
| 24 |
Correct |
22 ms |
2028 KB |
Output is correct |
