| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 799933 |
2023-08-01T08:34:45 Z |
OAleksa |
Stove (JOI18_stove) |
C++14 |
|
28 ms |
3124 KB |
#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int tt = 1;
//cin >> tt;
while(tt--) {
int n, k;
cin >> n >> k;
vector<int> a(n);
for(int i = 0;i < n;i++)
cin >> a[i];
vector<pair<int, int>> p(n);
for(int i = 1;i < n;i++)
p[i] = {a[i] - a[i - 1], i - 1};
sort(p.begin(), p.end(), greater<pair<int, int>>());
vector<int> g;
for(int i = 0;i < k - 1;i++)
g.push_back(p[i].s);
sort(g.begin(), g.end());
int ans = 0;
int ptr = a[0];
for(auto x : g) {
ans += a[x] + 1 - ptr;
ptr = a[x + 1];
}
ans += a[n - 1] + 1 - ptr;
cout << ans;
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 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 |
0 ms |
320 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 |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 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 |
0 ms |
320 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 |
332 KB |
Output is correct |
| 11 |
Correct |
1 ms |
340 KB |
Output is correct |
| 12 |
Correct |
1 ms |
332 KB |
Output is correct |
| 13 |
Correct |
1 ms |
340 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 |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 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 |
0 ms |
320 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 |
332 KB |
Output is correct |
| 11 |
Correct |
1 ms |
340 KB |
Output is correct |
| 12 |
Correct |
1 ms |
332 KB |
Output is correct |
| 13 |
Correct |
1 ms |
340 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 |
2364 KB |
Output is correct |
| 17 |
Correct |
17 ms |
2372 KB |
Output is correct |
| 18 |
Correct |
19 ms |
2452 KB |
Output is correct |
| 19 |
Correct |
23 ms |
2508 KB |
Output is correct |
| 20 |
Correct |
22 ms |
2764 KB |
Output is correct |
| 21 |
Correct |
28 ms |
3100 KB |
Output is correct |
| 22 |
Correct |
28 ms |
3124 KB |
Output is correct |
| 23 |
Correct |
25 ms |
3032 KB |
Output is correct |
| 24 |
Correct |
24 ms |
2980 KB |
Output is correct |
