This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define int long long
#define f(i, a, b) for(int i = a; i <= b; i++)
#define fr(i, a, b) for(int i = a; i >= b; i--)
#define pii pair <int, int>
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define in insert
#define vvec vector<vector<int>>
#define fast ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
const int N = 1e5 + 5;
const int M = 1e3 + 5;
int n, k, a[N], f[M][M];
vector <int> z;
signed main()
{
fast;
cin >> n >> k;
f(i, 1, n) cin >> a[i];
int res = a[n] + 1 - a[1];
f(i, 1, n - 1) z.eb(a[i + 1] - a[i] - 1);
sort(z.begin(), z.end(), greater <int> {});
f(i, 0, k - 2) res -= z[i];
cout << res;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |