제출 #1050478

#제출 시각아이디문제언어결과실행 시간메모리
1050478EntityPlanttStove (JOI18_stove)C++17
100 / 100
14 ms1808 KiB
#include <iostream>
#include <algorithm>
using namespace std;

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int n, k, x, y;
	cin >> n >> k >> x;
	int arr[n - 1];
	for (int i = 0; i < n - 1; i++) {
		cin >> y;
		arr[i] = y - x - 1;
		x = y;
	}
	sort(arr, arr + n - 1, greater<int>());
	x = n;
	for (int i = k - 1; i < n - 1; i++) x += arr[i];
	cout << x;
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...