Submission #1022527

#TimeUsernameProblemLanguageResultExecution timeMemory
1022527Hamed_GhaffariStove (JOI18_stove)C++17
100 / 100
39 ms2304 KiB
#include<bits/stdc++.h>
using namespace std;

using ll = long long;

#define pb push_back
#define all(x) x.begin(), x.end()

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.pb(t[i]-t[i-1]-1);
	}
	sort(all(vec));
	ll ans=n;
	for(int i=0; i<n-k; i++)
		ans += vec[i];
	cout << ans << '\n';
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...