# include <bits/stdc++.h>
# define speed ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
# define int long long
using namespace std;
const int N = 2e3 + 7;
int32_t main() {
speed;
int n, k;
cin >> n >> k;
vector < int > t(n), use(n);
vector < pair < int, int > > vc;
for ( int i = 0; i < n; i++ ) {
cin >> t[i];
}
for ( int i = 1; i < n; i++ ) {
vc.push_back( { t[i] - t[i - 1], i } );
}
sort( vc.rbegin(), vc.rend() );
for ( int i = 0; i < k - 1; i++ ) {
use[ vc[i].second ] = 1;
}
int p = t[0], ans = 0;
for ( int i = 0; i < n; i++ ) {
if ( use[i] ) {
ans += (t[i - 1] + 1) - p;
p = t[i];
}
}
ans += (t[n - 1] + 1) - p;
cout << ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Correct |
5 ms |
384 KB |
Output is correct |
5 |
Correct |
5 ms |
384 KB |
Output is correct |
6 |
Correct |
5 ms |
384 KB |
Output is correct |
7 |
Correct |
4 ms |
384 KB |
Output is correct |
8 |
Correct |
4 ms |
384 KB |
Output is correct |
9 |
Correct |
5 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Correct |
5 ms |
384 KB |
Output is correct |
5 |
Correct |
5 ms |
384 KB |
Output is correct |
6 |
Correct |
5 ms |
384 KB |
Output is correct |
7 |
Correct |
4 ms |
384 KB |
Output is correct |
8 |
Correct |
4 ms |
384 KB |
Output is correct |
9 |
Correct |
5 ms |
384 KB |
Output is correct |
10 |
Correct |
5 ms |
512 KB |
Output is correct |
11 |
Correct |
5 ms |
512 KB |
Output is correct |
12 |
Correct |
5 ms |
512 KB |
Output is correct |
13 |
Correct |
6 ms |
512 KB |
Output is correct |
14 |
Correct |
5 ms |
512 KB |
Output is correct |
15 |
Correct |
6 ms |
512 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Correct |
5 ms |
384 KB |
Output is correct |
5 |
Correct |
5 ms |
384 KB |
Output is correct |
6 |
Correct |
5 ms |
384 KB |
Output is correct |
7 |
Correct |
4 ms |
384 KB |
Output is correct |
8 |
Correct |
4 ms |
384 KB |
Output is correct |
9 |
Correct |
5 ms |
384 KB |
Output is correct |
10 |
Correct |
5 ms |
512 KB |
Output is correct |
11 |
Correct |
5 ms |
512 KB |
Output is correct |
12 |
Correct |
5 ms |
512 KB |
Output is correct |
13 |
Correct |
6 ms |
512 KB |
Output is correct |
14 |
Correct |
5 ms |
512 KB |
Output is correct |
15 |
Correct |
6 ms |
512 KB |
Output is correct |
16 |
Correct |
37 ms |
4600 KB |
Output is correct |
17 |
Correct |
32 ms |
4600 KB |
Output is correct |
18 |
Correct |
33 ms |
4600 KB |
Output is correct |
19 |
Correct |
33 ms |
4600 KB |
Output is correct |
20 |
Correct |
33 ms |
4600 KB |
Output is correct |
21 |
Correct |
34 ms |
4600 KB |
Output is correct |
22 |
Correct |
33 ms |
4600 KB |
Output is correct |
23 |
Correct |
33 ms |
4600 KB |
Output is correct |
24 |
Correct |
33 ms |
4600 KB |
Output is correct |