Submission #768835

#TimeUsernameProblemLanguageResultExecution timeMemory
768835dimashhhStove (JOI18_stove)C++17
100 / 100
35 ms6760 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int N = 1e6 + 123,MOD = 1e9 + 7; int n,k; ll a[N],dp[5100][5100],mn[5100]; void test(){ cin >> n >> k; for(int i = 1;i <= n;i++){ cin >> a[i]; } k--; multiset<ll> st; ll res = (a[n] - a[1] + 1); for(int i = 1;i < n;i++){ st.insert(abs(a[i] - a[i + 1]) - 1); } while(k--){ ll val = (*st.rbegin()); res -= val; st.erase(st.find(*st.rbegin())); //cout << val << '\n'; } cout << res; } int main(){ cin.tie(0);ios_base::sync_with_stdio(0); int T = 1; // cin >> T; while(T--){ test(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...