| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 693971 |
2023-02-03T13:22:39 Z |
Nahian9696 |
Stove (JOI18_stove) |
C++17 |
|
24 ms |
3224 KB |
#include <bits/stdc++.h>
using namespace std;
#define int int64_t
#define f0(i, n) for(int32_t i = 0; i < (n); i++)
#define f1(i, n) for(int32_t i = 1; i <= (n); i++)
#define inp(x) int x; cin >> x
#define inp2(a, b) int a, b; cin >> a >> b
void solve1() {
inp2(n, k);
int T[n];
f0(i, n) {
cin >> T[i];
}
vector<int> gaps;
f0(i, n-1) {
gaps.push_back(T[i+1] - T[i]-1);
}
sort(gaps.begin(), gaps.end(), greater<int>());
int ans = T[n-1] + 1 - T[0];
f0(i, k - 1) {
ans -= gaps[i];
}
cout << ans << endl;
}
int32_t main() {
#if __has_include("LOCAL.hh")
#include "LOCAL.hh"
#endif
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#else
ios_base::sync_with_stdio(0);
cin.tie(0);
#endif
solve1();
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
320 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
320 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
340 KB |
Output is correct |
| 11 |
Correct |
1 ms |
340 KB |
Output is correct |
| 12 |
Correct |
1 ms |
340 KB |
Output is correct |
| 13 |
Correct |
1 ms |
332 KB |
Output is correct |
| 14 |
Correct |
1 ms |
340 KB |
Output is correct |
| 15 |
Correct |
1 ms |
340 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
320 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
340 KB |
Output is correct |
| 11 |
Correct |
1 ms |
340 KB |
Output is correct |
| 12 |
Correct |
1 ms |
340 KB |
Output is correct |
| 13 |
Correct |
1 ms |
332 KB |
Output is correct |
| 14 |
Correct |
1 ms |
340 KB |
Output is correct |
| 15 |
Correct |
1 ms |
340 KB |
Output is correct |
| 16 |
Correct |
17 ms |
3156 KB |
Output is correct |
| 17 |
Correct |
18 ms |
3148 KB |
Output is correct |
| 18 |
Correct |
18 ms |
3220 KB |
Output is correct |
| 19 |
Correct |
18 ms |
3156 KB |
Output is correct |
| 20 |
Correct |
19 ms |
3124 KB |
Output is correct |
| 21 |
Correct |
18 ms |
3212 KB |
Output is correct |
| 22 |
Correct |
24 ms |
3108 KB |
Output is correct |
| 23 |
Correct |
18 ms |
3152 KB |
Output is correct |
| 24 |
Correct |
19 ms |
3224 KB |
Output is correct |
