#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;
int N,K, T[MX];
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> N >> K;
F0R(i,N) cin >> T[i];
vi dif;
F0R(i,N-1) dif.pb(T[i+1]-T[i]-1);
sort(all(dif));
int ans = T[N-1]-T[0]+1;
F0R(i,K-1) {
ans -= dif.back(); dif.pop_back();
}
cout << ans;
}
/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( )
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
252 KB |
Output is correct |
| 2 |
Correct |
3 ms |
492 KB |
Output is correct |
| 3 |
Correct |
3 ms |
492 KB |
Output is correct |
| 4 |
Correct |
3 ms |
592 KB |
Output is correct |
| 5 |
Correct |
3 ms |
596 KB |
Output is correct |
| 6 |
Correct |
2 ms |
764 KB |
Output is correct |
| 7 |
Correct |
3 ms |
768 KB |
Output is correct |
| 8 |
Correct |
2 ms |
768 KB |
Output is correct |
| 9 |
Correct |
3 ms |
768 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
252 KB |
Output is correct |
| 2 |
Correct |
3 ms |
492 KB |
Output is correct |
| 3 |
Correct |
3 ms |
492 KB |
Output is correct |
| 4 |
Correct |
3 ms |
592 KB |
Output is correct |
| 5 |
Correct |
3 ms |
596 KB |
Output is correct |
| 6 |
Correct |
2 ms |
764 KB |
Output is correct |
| 7 |
Correct |
3 ms |
768 KB |
Output is correct |
| 8 |
Correct |
2 ms |
768 KB |
Output is correct |
| 9 |
Correct |
3 ms |
768 KB |
Output is correct |
| 10 |
Correct |
4 ms |
768 KB |
Output is correct |
| 11 |
Correct |
4 ms |
768 KB |
Output is correct |
| 12 |
Correct |
4 ms |
872 KB |
Output is correct |
| 13 |
Correct |
4 ms |
872 KB |
Output is correct |
| 14 |
Correct |
4 ms |
1012 KB |
Output is correct |
| 15 |
Correct |
3 ms |
1012 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
252 KB |
Output is correct |
| 2 |
Correct |
3 ms |
492 KB |
Output is correct |
| 3 |
Correct |
3 ms |
492 KB |
Output is correct |
| 4 |
Correct |
3 ms |
592 KB |
Output is correct |
| 5 |
Correct |
3 ms |
596 KB |
Output is correct |
| 6 |
Correct |
2 ms |
764 KB |
Output is correct |
| 7 |
Correct |
3 ms |
768 KB |
Output is correct |
| 8 |
Correct |
2 ms |
768 KB |
Output is correct |
| 9 |
Correct |
3 ms |
768 KB |
Output is correct |
| 10 |
Correct |
4 ms |
768 KB |
Output is correct |
| 11 |
Correct |
4 ms |
768 KB |
Output is correct |
| 12 |
Correct |
4 ms |
872 KB |
Output is correct |
| 13 |
Correct |
4 ms |
872 KB |
Output is correct |
| 14 |
Correct |
4 ms |
1012 KB |
Output is correct |
| 15 |
Correct |
3 ms |
1012 KB |
Output is correct |
| 16 |
Correct |
30 ms |
2996 KB |
Output is correct |
| 17 |
Correct |
35 ms |
3836 KB |
Output is correct |
| 18 |
Correct |
35 ms |
4924 KB |
Output is correct |
| 19 |
Correct |
31 ms |
5800 KB |
Output is correct |
| 20 |
Correct |
26 ms |
6764 KB |
Output is correct |
| 21 |
Correct |
27 ms |
7744 KB |
Output is correct |
| 22 |
Correct |
30 ms |
8840 KB |
Output is correct |
| 23 |
Correct |
26 ms |
9804 KB |
Output is correct |
| 24 |
Correct |
27 ms |
10660 KB |
Output is correct |
