//*** Bismillah ***//
#pragma GCC optimize("O3")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("no-stack-protector")
#include <bits/stdc++.h>
using namespace std;
#if !defined(ONLINE_JUDGE) and !defined(EVAL)
#include "template/debug.h"
#else
#define d(x...)
#endif
#define fr first
#define sc second
#define in insert
#define ll long long
#define pb push_back
#define vll vector<ll>
#define pll pair<ll,ll>
#define vvll vector<vll>
#define vpll vector<pll>
#define len(x)(ll)x.size()
#define all(x)x.begin(),x.end()
const ll INF = 1e9;
const ll INFL = 1e18;
const ll MOD = 1e9+7;
// const ll MOD = 998244353;
const ll maxn = 2e5+5;
ll n,m,k=0;
void _(ll tt){
cin>>n>>m;
vll v;
ll x, bf;
for(ll i = 1; i <= n; i ++){
cin>>x;
if(i > 1){
v.pb(x - bf);
}
bf = x;
}
sort(all(v));
ll cv = n;
for(ll i = 0; i <= len(v) - m; i ++){
cv += v[i] - 1;
}
cout<<cv<<'\n';
}
signed main(){
ll tm=clock();
cin.tie(0)->sync_with_stdio(0);
ll t=1;
// cin>>t;
for(ll tt=1;tt<=t;tt++){
_(tt);
}
cerr<<"\n\033[1;31mTime: \033[1;30m" \
<<(double)(clock()-tm)/1000000<<"\033[1;32m seconds\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... |