Submission #364481

#TimeUsernameProblemLanguageResultExecution timeMemory
364481NachoLibreStove (JOI18_stove)C++17
100 / 100
22 ms1772 KiB
#include <bits/stdc++.h>
using namespace std;

const int N = 100005;
int n, k, a[N];

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> k;
	if(n == 1) return cout << 1 << endl, 0;
	for(int i = 0; i < n; ++i) {
		cin >> a[i];
		if(i) a[i - 1] = a[i] - a[i - 1] - 1;
	}
	sort(a, a + n - 1);
	long long fp = n;
	for(int i = 0; i < n - k; ++i) {
		fp += a[i];
	}
	cout << fp << endl;
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...