제출 #1049782

#제출 시각아이디문제언어결과실행 시간메모리
1049782vjudge1Stove (JOI18_stove)C++17
100 / 100
12 ms2012 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; #define pll pair<ll, ll> #define fi first #define se second #define pb push_back #define speed ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int main() { speed; int n, k; cin >> n >> k; vector<int> t(n); for(int i = 0; i < n; i++) cin >> t[i]; sort(begin(t), end(t)); vector<ll> v; int l = n; ll ans = 1ll * n; for(int i = 0; i < n - 1; i++) v.pb(1ll * (t[i+1] - t[i] - 1)); sort(begin(v), end(v)); for(ll i : v) { if(l > k) { ans += 1ll * i; l--; } } cout << ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...