This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/*input
10 5
1
2
5
6
8
11
13
15
16
20
*/
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main()
{
ios_base::sync_with_stdio(false);
ll N, K;
cin >> N >> K;
ll T[N];
for (int i = 0; i < N; i++)
cin >> T[i];
ll ans = N;
vector<ll>X;
for (int i = 1; i < N; i++)
X.push_back(T[i] - T[i - 1] - 1);
sort(X.begin(), X.end());
for (int i = 0; i < N - K; i++)
ans += X[i];
cout << ans << "\n";
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |