88分玄关求调

#include<bits/stdc++.h>
using namespace std;
int a[1000001];
int main(){
	long long n,w,minn;
	cin >> n >> w;
	for(int i=1;i<=n;i++) cin >> a[i];
	sort(a+1,a+n+1);
	if(w<=a[1]) minn=a[n]-w;	
	else if(w>=a[n]) minn=w-a[1];	
	else minn=a[n]-a[1];
	cout << minn << " ";
//--------------------------------------------
	long long last=w,ansl=0,ansr=0,t1=1,t2=n;
	if(w-a[1]>=a[n]-w){
		ansl+=abs(w-a[t1]);
		last=a[t1];
		t1++;
		for(int i=2;i<=n;i++){
			if(i%2==0){
				ansl+=max(abs(last-a[t2]),abs(w-a[t2]));
				last=a[t2];
				t2--;
			}else{
				ansl+=max(abs(last-a[t1]),abs(w-a[t1]));
				last=a[t1];
				t1++;
			}
		}
		cout << ansl;
	}else{
		ansr+=abs(w-a[t2]);
		last=a[t2];
		t2--;
		for(int i=2;i<=n;i++){
			if(i%2==0){
				ansr+=max(abs(last-a[t1]),abs(w-a[t1]));
				last=a[t1];
				t1++;
			}else{
				ansr+=max(abs(last-a[t2]),abs(w-a[t2]));
				last=a[t2];
				t2--;
			}
		}
		cout << ansr;
	}
	return 0;
}