Submission #1088489

#	Time	Username	Problem	Language	Result	Execution time	Memory
1088489		Staheos	Stove (JOI18_stove)	C++14	0 / 100	0 ms	344 KiB

stove

#include <iostream>
#include <queue>

using namespace std;

int main()
{
	int n, k;
	cin >> n >> k;
	int s = n;

	int* t = new int[n];
	for (int i = 0; i < n; i++)
	{
		cin >> t[i];
	}

	auto q = priority_queue<int>();
	for (int i = 1; i < n; i++)
	{
		if (t[i - 1] != t[i] - 1)
		{
			q.push(t[i] - t[i - 1] - 1);
		}
		else
		{
			s--;
		}
	}

	k--;
	while (k > 0 && !q.empty())
	{
		q.pop();
		k--;
	}

	while (!q.empty())
	{
		s += q.top();
		q.pop();
	}

	cout << s << '\n';
}

• Subtask 1: 0 / 20
• Subtask 2: 0 / 30
• Subtask 3: 0 / 50