Submission #3247515

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main() {
  int N, K, mmin = 100000000;
  int x[1000000];

  cin >> N >> K;

  for (int i = 0; i < N; i++) cin >> x[i];

  for (int i = 0; i < N - K + 1; i++) {
    int l = abs(x[i]) + abs(x[i+K-1] - x[i]);
    int r = abs(x[i+K-1]) + abs(x[i]- x[i+K-1]);
    int m = min(l, r);
    mmin = min(m, mmin);
  }

  cout << mmin << endl;

  return 0;
}

Submission Info

Judge Result