Submission #903928

#TimeUsernameProblemLanguageResultExecution timeMemory
903928zhasynStove (JOI18_stove)C++14
0 / 100
1067 ms348 KiB
#include <bits/stdc++.h> #define pb push_back #define pf push_front using namespace std; #define F first #define S second typedef long long ll; #define pii pair <int, int> #define pll pair <ll, ll> typedef long double ld; const ll N = 1e5 + 10, len = 316; const ll mod = 1e9 + 7; int arr[N]; int main() { // ios::sync_with_stdio(false); // cin.tie(NULL); int n, k, ans = 0; cin >> n >> k; for(int i = 0; i < n; i++){ cin >> arr[i]; } sort(arr, arr + n); set <int> st; int cur = arr[0], fir = arr[0], cnt = 1; for(int i = 1; i < n; i++){ if(arr[i] - cur <= 1) cur = arr[i]; else{ ans += (cur - fir + 1); cnt++; st.insert({arr[i] - cur - 1}); cur = fir = arr[i]; } } ans += (cur - fir + 1); while(cnt > k){ ans += *st.begin(); st.erase(st.begin()); cnt--; } cout << ans; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...