제출 #1163814

#제출 시각아이디문제언어결과실행 시간메모리
1163814hoangttnhatdhStove (JOI18_stove)C++20
100 / 100
16 ms1480 KiB
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+4;

int main(){
    ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
    int n,k;
    cin>>n>>k;
    vector<int> a(n+1);
    for(int i=1;i<=n;i++) cin>>a[i];
    if(n==1){
        cout<<1<<'\n';
        return 0;
    }
    priority_queue<int> pq;
    for(int i=2;i<=n;i++) pq.push(a[i]-a[i-1]);
    int ans=a[n]-a[1]+1;
    for(int i=2;i<=k;i++){
        int mx=pq.top();
        pq.pop();
        ans++;
        ans-=mx;
    }
    cout<<ans<<'\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...