Submission #4025502

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int main() {
  int N, K;
  cin >> N >> K;
  vector<long> Xp, Xm;
  long x;
  for (int i = 0; i < N; i++) {
    cin >> x;
    if (x < 0) Xm.push_back(abs(x));
    else if (0 < x) Xp.push_back(x);
    else K--;
  }
  if (Xm.size() == 0 && Xp.size() == 0) {
    cout << 0 << endl;
    return 0;
  }
  sort(Xm.begin(), Xm.end());
  sort(Xp.begin(), Xp.end());
  if (Xm.size() == 0) {
    cout << Xp[K-1] << endl;
    return 0;
  }
  if (Xp.size() == 0) {
    cout << Xm[K-1] << endl;
    return 0;
  }
  long ans = Xm.back() * 2 + Xp.back() * 2;
  for (int i = 0; i <= K; i++) {
    if (Xp.size() < i || Xm.size() < K-i) continue;
    long tmp1 = (i != 0) * Xp[i-1];
    long tmp2 = (K-i != 0) * Xm[K-i-1];
    ans = min({ans, tmp1*2 + tmp2, tmp1 + tmp2*2});
  }
  cout << ans << endl;
}

Submission Info

Judge Result