#include<bits/stdc++.h>
#define f first
#define s second
#define ll long long
using namespace std;
const int maxn=1e5+5;
const int MOD=1e9+7;
int n,k;
int a[maxn];
vector<int> vec;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin>>n>>k;
for(int i=1;i<=n;i++) cin>>a[i];
for(int i=1;i<n;i++) vec.push_back(a[i+1]-a[i]);
sort(vec.begin(),vec.end());
if(n<=k) cout<<n;
else{
int ans=n;
for(int i=0;i<n-k;i++){
ans+=vec[i]-1;
}
cout<<ans;
}
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |