Submission #405629

#TimeUsernameProblemLanguageResultExecution timeMemory
405629GurbanStove (JOI18_stove)C++17
20 / 100
2 ms332 KiB
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

const int maxn=1e5+5;
int n,k,nw = 1;
int t[maxn],ans;
vector<int>v;

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> n >> k;
	for(int i = 1;i <= n;i++){
		cin >> t[i];
		v.push_back(t[i] - t[i-1] - 1);
	}
	ans = t[n] - t[1] + 1;
	sort(v.begin(),v.end());
	reverse(v.begin(),v.end());
	for(int i = 0;i < k - 1;i++) ans -= v[i];
	cout<<ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...