Submission #230165

#	Time	Username	Problem	Language	Result	Execution time	Memory
230165		Haunted_Cpp	Stove (JOI18_stove)	C++17	100 / 100	35 ms	1408 KiB

stove

#include <iostream>
#include <queue>
#include <algorithm>

using namespace std;

const int N = 1e5 + 5;

int a [N];

int main () {
  ios::sync_with_stdio(0);
  int n, k;
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> a[i];
  sort (a, a + n);
  int res = a[n - 1] - a[0] + 1;
  --k;
  vector<int> dis;
  int rem = 0;
  priority_queue<int, vector<int>, greater<int> > pq;
  for (int i = 1; i < n; i++) {
    pq.push(a[i] - a[i - 1] - 1);
    if ( (int) pq.size() > k) pq.pop();
  }
  while (!pq.empty()) {
    rem += pq.top();
    pq.pop();
  }
  cout << res - rem << '\n';
  return 0;
}

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