//In The Name Of ALLAH!
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define ld long double
#define endl '\n'
#define pb push_back
#define pf push_front
#define Zemur007 ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define bpc __builtin_popcountll
#define btz __builtin_ctzll
#define all(x) x.begin() , x.end()
#define allr(x) x.rbegin() , x.rend()
#define F first
#define S second
#define pii pair<int , int>
#define pll pair<ll , ll>
#define turtle tuple<ll , ll , ll>
#define pss pair<string , string>
#define YES cout << "YES" << endl;
#define NO cout << "NO" << endl;
#define indexed_set tree<pll , null_type , less<pll> , rb_tree_tag , tree_order_statistics_node_update>
const ll sz = 2e5 + 5 , INF = 1e18 , MOD = 998244353;
ll a[sz];
ll mask , i , j , k;
void solve(){
ll n , k; cin >> n >> k;
for(i = 1 ; i <= n ; i++) cin >> a[i];
sort(a + 1 , a + n + 1);
ll sum = a[n] - a[1] + 1;
vector<ll> v;
for(i = 2 ; i <= n ; i++){
v.pb(a[i] - a[i - 1] - 1);
}
sort(all(v) , greater<ll>());
for(i = 0 ; i < k - 1 ; i++) sum -= v[i];
cout << sum << endl;
}
signed main(){
Zemur007;
// open();
ll t = 1;
// cin >> t;
while(t--){
solve();
}
// for(ll testcase = 1 ; testcase <= t ; testcase++){
// cout << "Case " << testcase << ":" << endl;
// solve();
// }
}
