# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1033658 |
2024-07-25T04:10:49 Z |
vjudge1 |
Stove (JOI18_stove) |
C++17 |
|
17 ms |
2404 KB |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using pear=pair<ll, ll>;
#define v vector
#define fi first
#define se second
#define nl << '\n'
#define uk << ' '
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
// freopen(".inp","r",stdin);
// freopen(".out","w",stdout);
cin.exceptions(cin.failbit);
ll n, k;
cin >> n >> k;
ll i;
vector<ll> a(n), gap;
for(i=0; i<n; i++){
cin >> a[i];
}
for(i=1; i<n; i++){
gap.push_back(a[i]-a[i-1]);
}
sort(gap.rbegin(), gap.rend());
ll ans=a[n-1]-a[0]+1;
for(i=0; i<k-1; i++){
ans-=gap[i]-1;
}
cout << ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 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 |
1 ms |
344 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 |
348 KB |
Output is correct |
13 |
Correct |
1 ms |
400 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 |
1 ms |
344 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 |
348 KB |
Output is correct |
13 |
Correct |
1 ms |
400 KB |
Output is correct |
14 |
Correct |
1 ms |
348 KB |
Output is correct |
15 |
Correct |
1 ms |
348 KB |
Output is correct |
16 |
Correct |
17 ms |
2268 KB |
Output is correct |
17 |
Correct |
16 ms |
2268 KB |
Output is correct |
18 |
Correct |
13 ms |
2404 KB |
Output is correct |
19 |
Correct |
13 ms |
2268 KB |
Output is correct |
20 |
Correct |
15 ms |
2264 KB |
Output is correct |
21 |
Correct |
13 ms |
2268 KB |
Output is correct |
22 |
Correct |
13 ms |
2268 KB |
Output is correct |
23 |
Correct |
13 ms |
2268 KB |
Output is correct |
24 |
Correct |
13 ms |
2268 KB |
Output is correct |