//wait darn
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef set<ll>::iterator slt;
ll st,fi;
multiset<ll> df;
ll K;
void input() {
int N; cin >> N >> K;
ll pre, cur;
for(int i = 0; i < N; i++) {
cin >> cur;
if(i == 0) st = cur;
else df.insert(pre-cur);
if(i == N-1) fi = cur+1;
else pre = cur+1;
}
}
void solve() {
K--;
ll ans = fi-st;
int i = 0;
slt it = df.begin();
for(; i < K; i++, it++) {ans += (*it);}
cout << ans << endl;
}
int main() {
input();
solve();
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
2 ms |
376 KB |
Output is correct |
8 |
Correct |
2 ms |
256 KB |
Output is correct |
9 |
Correct |
2 ms |
376 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
2 ms |
376 KB |
Output is correct |
8 |
Correct |
2 ms |
256 KB |
Output is correct |
9 |
Correct |
2 ms |
376 KB |
Output is correct |
10 |
Correct |
5 ms |
420 KB |
Output is correct |
11 |
Correct |
5 ms |
504 KB |
Output is correct |
12 |
Correct |
5 ms |
504 KB |
Output is correct |
13 |
Correct |
5 ms |
504 KB |
Output is correct |
14 |
Correct |
5 ms |
504 KB |
Output is correct |
15 |
Correct |
5 ms |
504 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
2 ms |
376 KB |
Output is correct |
8 |
Correct |
2 ms |
256 KB |
Output is correct |
9 |
Correct |
2 ms |
376 KB |
Output is correct |
10 |
Correct |
5 ms |
420 KB |
Output is correct |
11 |
Correct |
5 ms |
504 KB |
Output is correct |
12 |
Correct |
5 ms |
504 KB |
Output is correct |
13 |
Correct |
5 ms |
504 KB |
Output is correct |
14 |
Correct |
5 ms |
504 KB |
Output is correct |
15 |
Correct |
5 ms |
504 KB |
Output is correct |
16 |
Correct |
124 ms |
5980 KB |
Output is correct |
17 |
Correct |
122 ms |
5964 KB |
Output is correct |
18 |
Correct |
123 ms |
5984 KB |
Output is correct |
19 |
Correct |
123 ms |
6008 KB |
Output is correct |
20 |
Correct |
122 ms |
6008 KB |
Output is correct |
21 |
Correct |
128 ms |
6008 KB |
Output is correct |
22 |
Correct |
127 ms |
6052 KB |
Output is correct |
23 |
Correct |
122 ms |
6008 KB |
Output is correct |
24 |
Correct |
127 ms |
5988 KB |
Output is correct |