제출 #1272437

#제출 시각아이디문제언어결과실행 시간메모리
1272437kanyeStove (JOI18_stove)C++20
100 / 100
36 ms1064 KiB
#include <bits/stdc++.h>

using namespace std;

int v[100005];
int d[100005];

int main()
{
    int n,k;
    long long int s=0;
    cin>>n>>k;
    k--;
    for(int i=1;i<=n;i++){
        cin>>v[i];
    }
    v[n+1]=v[n];
    s=v[n]-v[1]+1;
    for(int i=1;i<=n;i++){
        d[i]=v[i+1]-v[i]+1;
    }
    sort(d+1, d+n+1);
    for(int i=n;i>n-k;i--){
        s-=d[i]-2;
    }
    cout<<s;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...