提出 #67547178

---

ソースコード 拡げる

#include <bits/stdc++.h>

using namespace std;


void solve(){
  int n, m;
  cin >> n >> m;
  vector<long long> x(n);
  for(auto &val : x){
    cin >> val;
  }
  sort(x.begin(), x.end());
  x.erase(unique(x.begin(), x.end()), x.end());
  n = (int) x.size();
  if(n <= m){
    cout << 0;
    return;
  }
  vector<long long> diff(n - 1);
  for(int i = 0; i < n - 1; ++i){
    diff[i] = x[i + 1] - x[i];
  }
  sort(diff.rbegin(), diff.rend());
  long long ans = x[n - 1] - x[0];
  for(int i = 0; i < m - 1; ++i){
    ans -= diff[i];
  }
  cout << ans;
}

int main(){ 
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout << fixed << showpoint << setprecision(10);

  int T = 1;
  //cin >> T;
  while(T--){
    solve();
  }
}

提出情報

ジャッジ結果