제출 #1121385

#제출 시각아이디문제언어결과실행 시간메모리
1121385kasdoStove (JOI18_stove)C++14
100 / 100
43 ms3184 KiB
#include <bits/stdc++.h> using namespace std; #define int long long signed main() { int n, k; cin>>n>>k; int a[n + 5]; priority_queue<int> q; for(int i=0; i<n; i++) { cin>>a[i]; if (i) q.push(a[i] - a[i - 1] - 1); } int ans = a[n - 1] - a[0] + 1; for(int i=0; i<k-1; i++) { // cout<<q.top()<<endl; ans -= q.top(); q.pop(); } cout<<ans<<endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...