Submission #5901564

---

Source Code Expand

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

int main() {
	long long N, M, C, COUNT = 0;
	set<long long> S;
	cin >> N >> M;
	S.insert(M);
	for (int i = 0; i < N; i++) {
		cin >> C;
		auto it = S.lower_bound(C);
		long long X = 1145141919810364364;
		if (it != S.end()) X = min(X, *it - C);
		if (it != S.begin()) X = min(X, C - *--it);
		COUNT += X;
		S.insert(C);
	}
	cout << COUNT << endl;
}

Submission Info

Judge Result