| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1033534 |
2024-07-25T03:09:12 Z |
sp69t |
Stove (JOI18_stove) |
C++14 |
|
13 ms |
2220 KB |
#include<bits/stdc++.h>
#define endl "\n"
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
vector<int> a(n), s(n - 1);
for (int i = 0; i < n; ++i) cin >> a[i];
long long total_time = a[n - 1] - a[0] + 1;
for (int i = 0; i < n - 1; ++i) s[i] = a[i + 1] - a[i] - 1;
sort(s.begin(), s.end(), greater<int>());
for (int i = 0; i < k - 1; ++i) total_time -= s[i];
cout << total_time << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
1 ms |
348 KB |
Output is correct |
| 11 |
Correct |
1 ms |
348 KB |
Output is correct |
| 12 |
Correct |
1 ms |
516 KB |
Output is correct |
| 13 |
Correct |
1 ms |
348 KB |
Output is correct |
| 14 |
Correct |
1 ms |
348 KB |
Output is correct |
| 15 |
Correct |
1 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
1 ms |
348 KB |
Output is correct |
| 11 |
Correct |
1 ms |
348 KB |
Output is correct |
| 12 |
Correct |
1 ms |
516 KB |
Output is correct |
| 13 |
Correct |
1 ms |
348 KB |
Output is correct |
| 14 |
Correct |
1 ms |
348 KB |
Output is correct |
| 15 |
Correct |
1 ms |
348 KB |
Output is correct |
| 16 |
Correct |
13 ms |
2140 KB |
Output is correct |
| 17 |
Correct |
13 ms |
2000 KB |
Output is correct |
| 18 |
Correct |
13 ms |
2136 KB |
Output is correct |
| 19 |
Correct |
13 ms |
2140 KB |
Output is correct |
| 20 |
Correct |
13 ms |
2128 KB |
Output is correct |
| 21 |
Correct |
13 ms |
2140 KB |
Output is correct |
| 22 |
Correct |
13 ms |
2140 KB |
Output is correct |
| 23 |
Correct |
13 ms |
2220 KB |
Output is correct |
| 24 |
Correct |
13 ms |
2132 KB |
Output is correct |
