Submission #818711

#TimeUsernameProblemLanguageResultExecution timeMemory
818711vjudge1Stove (JOI18_stove)C++17
100 / 100
20 ms1368 KiB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int N, K;

int main() {
      cin.tie(0); ios_base::sync_with_stdio(0);

      cin >> N >> K;
      vector<int> t(N);

      for(int i = 0; i < N; i++) cin >> t[i];

      int ans = t.back() - t[0] + 1;

      vector<int> v;
      for(int i = 1; i < N; i++) {
            v.push_back(t[i] - t[i - 1] - 1);
      }

      sort(v.begin(), v.end());

      while(!v.empty() && K > 1) {
            ans -= v.back();
            K--;
            v.pop_back();
      }

      cout << ans << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...