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>
using namespace std;
using ll = long long;
const int MXN=1e5+5;
int n, k, t[MXN];
int main() {
cin >> n >> k;
vector<int> vec;
for(int i=1; i<=n; i++)
{
cin >> t[i];
if(i>1)
{
vec.push_back(t[i]-t[i-1]-1);
}
}
sort(vec.begin(), vec.end());
ll ans=n;
for(int i=0; i<n-k; i++)
{
ans += vec[i];
}
cout << ans << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |