제출 #944273

#제출 시각아이디문제언어결과실행 시간메모리
944273dugersurenStove (JOI18_stove)C++17
100 / 100
15 ms2300 KiB
# include <bits/stdc++.h>
#define ll long long
#define MAX 100003
using namespace std;
int n, k, t[MAX]; 
int main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    cin>>n>>k;
    vector <int> e;
    for (int i = 1; i <= n; ++i) {
        cin >> t[i];
        if (i > 1) e.push_back(t[i] - t[i - 1] - 1);
    }
    sort(e.rbegin(), e.rend());
    int ans = t[n] + 1 - t[1];
    
    	
    for (int i = 0; i < min(((int)e.size()), k - 1); ++i) ans -= e[i];
    cout << ans <<'\n';
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...