Submission #67552402

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
#define LL long long
LL n,m,a[500010];
int main(){
    cin >> n >> m;
    priority_queue<LL> q;
    for(int i=1;i<=n;i++){
        cin >> a[i];
    }
    sort(a+1,a+1+n);
    for(int i=1;i<n;i++) {
        q.push(a[i+1]-a[i]);
    }
    while (m>1){
        m--;
        if(!q.empty()) q.pop();
    }
    LL ans = 0;
    while (!q.empty()){
        ans += q.top();
        q.pop();
    }
    cout << ans;
    return 0;
}

Submission Info

Judge Result