Submission #941223

#TimeUsernameProblemLanguageResultExecution timeMemory
941223freedommo33Stove (JOI18_stove)C++17
100 / 100
20 ms2292 KiB
#include <bits/stdc++.h>

using namespace std;
constexpr int M = 100005;
int tab[M];

bool czy(int a, int b){ return b<a; }
int main(){
	cin.tie(0)->sync_with_stdio(0);
	int n, k;
	cin>>n>>k;
	for(int i=1; i<=n; i++) cin>>tab[i];
	vector<int> przerwy;
	for(int i=n; i>1; i--){
		przerwy.push_back(tab[i]-tab[i-1]-1);
	}
	sort(przerwy.begin(), przerwy.end(), czy);
	int ile = 0;
	for(int i=1; i<=k-1; i++) ile+=przerwy[i-1];
	cout<<tab[n] - tab[1] + 1 - ile<<endl;
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...