# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
653706 |
2022-10-27T18:37:35 Z |
sofija6 |
Stove (JOI18_stove) |
C++14 |
|
22 ms |
3284 KB |
#include <bits/stdc++.h>
#define ll long long
#define MAXN 100010
using namespace std;
ll t[MAXN];
vector<ll> d;
int main()
{
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
ll n,k,ans;
cin >> n >> k;
for (ll i=1;i<=n;i++)
cin >> t[i];
ans=t[n]+1-t[1];
for (ll i=2;i<=n;i++)
d.push_back(t[i]-t[i-1]-1);
sort(d.begin(),d.end(),greater<ll>());
for (ll i=0;i<k-1;i++)
ans-=d[i];
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 |
332 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
332 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 |
332 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
332 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 |
340 KB |
Output is correct |
11 |
Correct |
2 ms |
340 KB |
Output is correct |
12 |
Correct |
1 ms |
340 KB |
Output is correct |
13 |
Correct |
2 ms |
340 KB |
Output is correct |
14 |
Correct |
1 ms |
344 KB |
Output is correct |
15 |
Correct |
2 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 |
332 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
332 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 |
340 KB |
Output is correct |
11 |
Correct |
2 ms |
340 KB |
Output is correct |
12 |
Correct |
1 ms |
340 KB |
Output is correct |
13 |
Correct |
2 ms |
340 KB |
Output is correct |
14 |
Correct |
1 ms |
344 KB |
Output is correct |
15 |
Correct |
2 ms |
340 KB |
Output is correct |
16 |
Correct |
20 ms |
3156 KB |
Output is correct |
17 |
Correct |
17 ms |
3116 KB |
Output is correct |
18 |
Correct |
18 ms |
3156 KB |
Output is correct |
19 |
Correct |
19 ms |
3176 KB |
Output is correct |
20 |
Correct |
18 ms |
3140 KB |
Output is correct |
21 |
Correct |
22 ms |
3244 KB |
Output is correct |
22 |
Correct |
19 ms |
3284 KB |
Output is correct |
23 |
Correct |
20 ms |
3212 KB |
Output is correct |
24 |
Correct |
20 ms |
3160 KB |
Output is correct |