Submission #790242

#TimeUsernameProblemLanguageResultExecution timeMemory
790242n3rm1nStove (JOI18_stove)C++17
0 / 100
0 ms212 KiB
#include<bits/stdc++.h> #define endl '\n' using namespace std; const int MAXN = 1e5 + 10; void speed() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } int n, k, a[MAXN]; void read() { cin >> n >> k; for (int i = 1; i <= n; ++ i) cin >> a[i]; } void solve() { vector < int > g; int ans = a[n] - a[1]; for (int i = 2; i <= n; ++ i) { g.push_back(- max(0, a[i] - a[i-1] - 1)); } sort(g.begin(), g.end()); int i = 1; while(i < k) { ans += g[i]; i ++; } cout << ans << endl; } int main() { speed(); read(); solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...