제출 #990582

#제출 시각아이디문제언어결과실행 시간메모리
990582StuckOnAStove (JOI18_stove)C++17
0 / 100
0 ms348 KiB
#include <bits/stdc++.h>
using namespace std;
int main()
{
	int n, k;
	cin >> n >> k;
	vector<int> v(n), vd(n - 1);
	for (int i = 0; i < n; i++) cin >> v[i];
	for (int i = 0; i < n - 1; i++)
		vd[i] = v[i + 1] - v[i] - 1;
	sort(vd.rbegin(), vd.rend());
	int sum = 0;
	for (int i = 0; i < k - 1; i++)
		sum += vd[i];
	cout << *max_element(v.begin(), v.end()) - sum << endl;
	
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...