제출 #405635

#제출 시각아이디문제언어결과실행 시간메모리
405635GurbanStove (JOI18_stove)C++17
100 / 100
26 ms2196 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; const int maxn=1e5+5; int n,k; int t[maxn],ans; vector<int>v; int main(){ ios::sync_with_stdio(false); cin.tie(0); cin >> n >> k; for(int i = 1;i <= n;i++){ cin >> t[i]; if(i != 1) v.push_back(t[i] - t[i-1] - 1); } ans = t[n] - t[1] + 1; sort(v.begin(),v.end()); reverse(v.begin(),v.end()); for(int i = 0;i < min((int)v.size(),k - 1);i++) ans -= v[i]; cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...