| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 461341 |
2021-08-09T21:54:22 Z |
Hamed5001 |
Stove (JOI18_stove) |
C++14 |
|
23 ms |
2328 KB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve() {
int N, K;
cin >> N >> K;
int ans = N;
vector<int> T(N); for (auto& t : T) cin >> t;
vector<int> diff;
for (int i = 0; i+1 < N; i++)
diff.push_back(T[i+1] - T[i] - 1);
sort(diff.begin(), diff.end());
for (auto it : diff)
ans += it;
for (int i = diff.size()-1; K > 1 && i > 0; --K, --i) {
ans -= diff[i];
}
cout << ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
solve();
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
1 ms |
312 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
312 KB |
Output is correct |
| 7 |
Correct |
0 ms |
204 KB |
Output is correct |
| 8 |
Correct |
0 ms |
312 KB |
Output is correct |
| 9 |
Correct |
1 ms |
204 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
1 ms |
312 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
312 KB |
Output is correct |
| 7 |
Correct |
0 ms |
204 KB |
Output is correct |
| 8 |
Correct |
0 ms |
312 KB |
Output is correct |
| 9 |
Correct |
1 ms |
204 KB |
Output is correct |
| 10 |
Correct |
1 ms |
332 KB |
Output is correct |
| 11 |
Correct |
1 ms |
332 KB |
Output is correct |
| 12 |
Correct |
1 ms |
320 KB |
Output is correct |
| 13 |
Correct |
1 ms |
332 KB |
Output is correct |
| 14 |
Correct |
1 ms |
328 KB |
Output is correct |
| 15 |
Correct |
1 ms |
332 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
1 ms |
312 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
312 KB |
Output is correct |
| 7 |
Correct |
0 ms |
204 KB |
Output is correct |
| 8 |
Correct |
0 ms |
312 KB |
Output is correct |
| 9 |
Correct |
1 ms |
204 KB |
Output is correct |
| 10 |
Correct |
1 ms |
332 KB |
Output is correct |
| 11 |
Correct |
1 ms |
332 KB |
Output is correct |
| 12 |
Correct |
1 ms |
320 KB |
Output is correct |
| 13 |
Correct |
1 ms |
332 KB |
Output is correct |
| 14 |
Correct |
1 ms |
328 KB |
Output is correct |
| 15 |
Correct |
1 ms |
332 KB |
Output is correct |
| 16 |
Correct |
21 ms |
2236 KB |
Output is correct |
| 17 |
Correct |
23 ms |
2320 KB |
Output is correct |
| 18 |
Correct |
21 ms |
2236 KB |
Output is correct |
| 19 |
Correct |
21 ms |
2256 KB |
Output is correct |
| 20 |
Correct |
22 ms |
2280 KB |
Output is correct |
| 21 |
Correct |
21 ms |
2240 KB |
Output is correct |
| 22 |
Correct |
21 ms |
2236 KB |
Output is correct |
| 23 |
Correct |
21 ms |
2240 KB |
Output is correct |
| 24 |
Correct |
21 ms |
2328 KB |
Output is correct |
