Submission #5901557

---

Source Code Expand

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

int main() {
	long long N, M, C, COUNT = 0;
	vector<long long> V;
	cin >> N >> M;
	V.push_back(M);
	for (int i = 0; i < N; i++) {
		cin >> C;
		long long X = lower_bound(V.begin(), V.end(), C) - V.begin();
		if (X == i + 1) COUNT += C - V[i];
		else if (X == 0) COUNT += V[0] - C;
		else COUNT += min(C - V[X - 1], V[X] - C);
		V.push_back(C);
		sort(V.begin(), V.end());
	}
	cout << COUNT << endl;
}

Submission Info

Judge Result