Submission #863958

#TimeUsernameProblemLanguageResultExecution timeMemory
863958MongHwaStove (JOI18_stove)C++17
100 / 100
15 ms2452 KiB
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int arr[100001];

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

	int n, k;
	cin >> n >> k;

	for(int i = 0; i < n; i++)
		cin >> arr[i];

	vector<int> v;
	for(int i = 1; i < n; i++)
		v.push_back(arr[i]-arr[i-1]-1);

	sort(v.begin(), v.end(), greater<>());
	
	int ans = arr[n-1]-arr[0]+1;
	for(int i = 0; i < k-1; i++)
		ans -= v[i];

	cout << ans << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...