Submission #949310

#TimeUsernameProblemLanguageResultExecution timeMemory
949310SoSmolStenStove (JOI18_stove)C++17
100 / 100
18 ms3376 KiB
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e5 + 10;
ll t[N];
int main (int argc, char const *argv[]) {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n, k; cin >> n >> k;
	for(int i = 1; i <= n; ++i){
		cin >> t[i];
	}	
	ll res = t[n] - t[1] + 1;
	vector<ll> diff;
	for(int i = 2; i <= n; ++i){
		diff.push_back(t[i] - t[i - 1] - 1);
	}
	sort(diff.begin(), diff.end(), greater<ll>());
	for(int i = 0; i < k - 1; ++i) res -= diff[i];
	cout << res;
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...