Submission #952328

#TimeUsernameProblemLanguageResultExecution timeMemory
952328abczzStove (JOI18_stove)C++14
100 / 100
36 ms3024 KiB
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#define ll long long

using namespace std;

vector <ll> V;
ll n, k, f, A[100000];
int main() {
  cin >> n >> k;
  f = n;
  for (int i=0; i<n; ++i) {
    cin >> A[i];
    if (i) V.push_back(A[i]-A[i-1]-1);
  }
  sort(V.begin(), V.end());
  for (int i=0; i<n-k; ++i) {
    f += V[i];
  }
  cout << f << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...