제출 #885421

#제출 시각아이디문제언어결과실행 시간메모리
885421raspyStove (JOI18_stove)C++14
100 / 100
42 ms3048 KiB
#include <iostream>
#include <queue>
#include <vector>

#define int long long

using namespace std;

int a[200005];

int32_t main()
{
	int n, k;
	cin >> n >> k;
	priority_queue<int, vector<int>, greater<int>> pq;
	int tr = 1;
	for (int i = 0; i < n; i++)
	{
		cin >> a[i];
		if (i && a[i] != a[i-1]+1)
		{
			tr++;
			pq.push(a[i]-a[i-1]-1);
		}
	}
	int rez = n;
	while (tr > k)
	{
		rez += pq.top();
		pq.pop();
		tr--;
	}
	cout << rez << "\n";
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...