제출 #819148

#제출 시각아이디문제언어결과실행 시간메모리
819148vjudge1Stove (JOI18_stove)C++17
100 / 100
18 ms1492 KiB
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define se second
#define fi first
#define pii pair<int,int>
#define pll pair<long long, long long>

ll k, n, fin, start, pirst;
vector<ll> duration;

void solve(){
    cin >> n >> k;
    cin >> start;
    pirst=start;
    if(n==1){
        cout << 1 << endl;
        return;
    }
    for(int i=1; i<n; i++){
        cin >> fin;
        duration.push_back(fin-start);
        start=fin;
    }
    fin-=(pirst-1);
    sort(duration.begin(), duration.end(), greater());
    k--;
    for(int i=0; i<k; i++){
        fin-=(duration[i]-1);
    }
    cout << fin << endl;
}
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    solve();
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...