제출 #1331103

#제출 시각아이디문제언어결과실행 시간메모리
1331103kikiiStove (JOI18_stove)C++20
100 / 100
36 ms1056 KiB
#include<bits/stdc++.h>
using namespace std;

int main(){
    int n,k;
    cin >> n >> k;
    vector<int> v(n);
    for(int i = 0; i < n; i ++){
        cin >> v[i];
    }
    vector<int> gap(n-1);
    for(int i =0; i < n-1; i ++){
        gap[i] = v[i+1] - v[i] - 1;
    }
    int ans = 0;
    ans = n;
    sort(gap.begin(), gap.end());
    for (int i = gap.size() ;i > 0; i --){
        k -= 1;
        if (k > 0){
            gap[i-1] = 0;
        }
    }
    for(int i = 0; i < n-1; i ++){\
        ans += gap[i];
    }
    cout << ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...