제출 #1023344

#제출 시각아이디문제언어결과실행 시간메모리
1023344biserailievaStove (JOI18_stove)C++14
100 / 100
42 ms2292 KiB
#include<bits/stdc++.h> using namespace std; using ll = long long; const int MXN=1e5+5; int n, k, t[MXN]; int main() { cin >> n >> k; vector<int> vec; for(int i=1; i<=n; i++) { cin >> t[i]; if(i>1) { vec.push_back(t[i]-t[i-1]-1); } } sort(vec.begin(), vec.end()); ll ans=n; for(int i=0; i<n-k; i++) { ans += vec[i]; } cout << ans << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...