| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1031394 |
2024-07-22T19:15:41 Z |
andrewp |
Stove (JOI18_stove) |
C++14 |
|
14 ms |
3292 KB |
//Dedicated to my love, ivaziva
#include <bits/stdc++.h>
using namespace std;
#define ll int64_t
#define ar array
#define dbg(x) cerr << #x << ": " << x << "\n";
const int mxN=1e5+1;
ll n, k, a[mxN];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k; --k;
vector<ll> b;
for(ll i=1; i<=n; ++i) cin >> a[i];
ll ans=a[n]-a[1];
for(ll i=2; i<=n; ++i) {
b.push_back(a[i]-a[i-1]-1);
}
sort(b.begin(), b.end(), greater<int>());
for(int i=0; i<k; ++i) {
ans-=b[i];
}
cout << ans+1 << "\n";
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 |
344 KB |
Output is correct |
| 12 |
Correct |
1 ms |
348 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 |
344 KB |
Output is correct |
| 12 |
Correct |
1 ms |
348 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 |
3292 KB |
Output is correct |
| 17 |
Correct |
13 ms |
3292 KB |
Output is correct |
| 18 |
Correct |
13 ms |
3292 KB |
Output is correct |
| 19 |
Correct |
13 ms |
3288 KB |
Output is correct |
| 20 |
Correct |
13 ms |
3292 KB |
Output is correct |
| 21 |
Correct |
14 ms |
3268 KB |
Output is correct |
| 22 |
Correct |
13 ms |
3292 KB |
Output is correct |
| 23 |
Correct |
13 ms |
3292 KB |
Output is correct |
| 24 |
Correct |
14 ms |
3292 KB |
Output is correct |
