Submission #67543223

---

Source Code Expand

#include<bits/stdc++.h>
using ll=long long;
using namespace std;
int read(){int f=0,x=0;char a=getchar();while(!isdigit(a)){if(a=='-')f=1;a=getchar();}while(isdigit(a)){x=x*10+a-'0';a=getchar();}if(f)return -x;return x;}
void solve()
{
    ll n,m;
    cin>>n>>m;
    vector<ll>a(n+1);
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    sort(a.begin()+1,a.end());
    ll ans=0;
    priority_queue<ll>q;
    for(int i=1;i<n;i++)
    {
        q.push(a[i+1]-a[i]);
        ans+=a[i+1]-a[i];
    }
    for(int i=1;i<m;i++)
    {
        ans-=q.top();
        q.pop();
    }
    cout<<ans;
}
int main()
{
    //freopen(in.in,r,stdin);
    //freopen(out.out,w,stdout);
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t=1;
    while(t--)
    {
        solve();
    }
    return 0;
}

Submission Info

Judge Result