Submission #541670

#TimeUsernameProblemLanguageResultExecution timeMemory
541670pokmui9909Stove (JOI18_stove)C++17
100 / 100
25 ms2976 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; ll N, K; ll A[100005]; int main(){ cin.tie(0) -> sync_with_stdio(false); cin >> N >> K; vector<ll> V; for(int i = 1; i <= N; i++){ cin >> A[i]; if(i > 1) V.push_back(A[i] - A[i - 1] - 1); } sort(V.begin(), V.end()); ll ans = 0; for(int i = 0; i < N - K; i++){ ans += V[i]; } cout << ans + N; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...