Submission #853537

#TimeUsernameProblemLanguageResultExecution timeMemory
853537lamterStove (JOI18_stove)C++17
100 / 100
15 ms2392 KiB
#include <bits/stdc++.h>

int main(void) {
	std::ios_base::sync_with_stdio(0);
	std::cin.tie(nullptr);

	int n, k; std::cin >> n >> k;
	std::vector <int> a(n);
	std::vector <int> b; b.reserve(n - 1);
	k = std::min(k - 1, n);
	for (int i = 0; i < n; i += 1) {
		std::cin >> a[i];
		if (i)
			b.push_back(a[i] - a[i - 1] - 1);
	}

	int ans = a[n - 1] - a[0] + 1;
	std::sort(b.begin(), b.end(), std::greater <> ());
	std::cout << ans - std::accumulate(b.begin(), b.begin() + k, 0) << '\n';

	return 0^0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...