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;
#define ll long long
#define fi first
#define se second
#define endl '\n'
const ll MOD=1e9+7;
int a[100005];
vector<int> vec;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n,k;
cin>>n>>k;
for(int i=1;i<=n;i++)
{
cin>>a[i];
if(i>1) vec.push_back(a[i]-a[i-1]-1);
}
ll tot=a[n]-a[1]+1;
sort(vec.begin(),vec.end(),greater<int>());
for(int i=0;i<min((int)(vec.size()),k-1);i++)
{
tot-=vec[i];
}
cout<<tot;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |