Submission #528006

#TimeUsernameProblemLanguageResultExecution timeMemory
528006HydrolyzedStove (JOI18_stove)C++14
100 / 100
24 ms2300 KiB
/* * AUTHOR : Hydrolyzed~ * SCHOOL : RYW * TASK : JOI18_Stove * ALGO : * DATE : 19 Feb 2022 * */ #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #include <ext/rope> // @==== Libary ====@ // // @================@ // using namespace std; using namespace __gnu_pbds; using namespace __gnu_cxx; template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update> ; // @=== Debugger ===@ // #ifdef _DEBUG #include "debug.hpp" #else #define dbg(...) 0 #endif // @================@ // using ll = long long; const int MxN = 100100; priority_queue<int> pq; int a[MxN]; inline void solution(){ int n, k; cin >> n >> k; for(int i=1; i<=n; ++i){ cin >> a[i]; } int res = a[n] - a[1] + 1; for(int i=1; i<n; ++i){ pq.push(a[i + 1] - a[i] - 1); } while(!pq.empty(), --k){ res -= pq.top(); pq.pop(); } cout << res; return ; } signed main(){ cin.tie(nullptr)->ios::sync_with_stdio(false); int q = 1; // cin >> q; while(q--){ solution(); cout << "\n"; } return 0; } // https://github.com/MasterIceZ/archive/tree/main/cpp-template
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...