제출 #106873

#제출 시각아이디문제언어결과실행 시간메모리
106873FiloSanzaStove (JOI18_stove)C++14
100 / 100
34 ms2432 KiB
#include <bits/stdc++.h> using namespace std; int main(){ cin.tie(0); cin.sync_with_stdio(0); int N, K; int ans = 0; cin >> N >> K; vector<int> v(N); for(auto &i : v) cin >> i; sort(v.begin(), v.end()); ans = v.back() - v.front() + 1; priority_queue<int> diff; for(int i=1; i<N; i++) diff.push(v[i]-v[i-1]-1); while(--K && !diff.empty()) ans -= diff.top(), diff.pop(); cout << ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...