Submission #850906

#TimeUsernameProblemLanguageResultExecution timeMemory
850906kflippyStove (JOI18_stove)C++17
100 / 100
15 ms2368 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int N, K;

int main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> N >> K;
  int t[N];
  for (int i = 0; i < N; ++i)
    cin >> t[i];
  int total = t[N - 1] - t[0] + 1;
  vector<int> take;
  for (int i = 1; i < N; ++i)
  {
    take.push_back(t[i] - t[i - 1] - 1);
  }
  sort(take.begin(), take.end(), greater<int>());
  for (int i = 0; i < K - 1; ++i)
  {
    total -= take[i];
  }
  cout << total << "\n";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...