Submission #1017649

#TimeUsernameProblemLanguageResultExecution timeMemory
1017649Bilal_CoderStove (JOI18_stove)C++17
0 / 100
0 ms348 KiB
#include "bits/stdc++.h" using namespace std; #define int long long signed main() { int n , k; cin >> n >> k; vector<int> a(n); vector<int> b; for (int i = 0; i < n; i++){ cin >> a[i]; if (i > 0) b.push_back(a[i] - (a[i - 1]) - 1); } sort(b.rbegin() , b.rend()); int m = (int)b.size(); vector<int> pf(m); pf[0] = b[0]; for (int i = 1; i < m; i++) pf[i] = pf[i - 1] + b[i]; if (k == 1){ if (a[0] == 1) cout << a[n - 1] - a[0] + 1 << "\n"; else cout << a[n - 1] - a[0] + 2; } else cout << a[n - 1] - pf[k - 2] << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...