疯狂队列

	#include <bits/stdc++.h>



	using namespace std;



	 



	int main()



	{



	    int n;



	    cin >> n;



	    vector<int> res(n);



	    vector<int> result(n);



	    for(inti = 0; i < n; ++i)



	        cin >> res[i];



	    sort(res.begin(), res.end());



	    int left = 0;



	    int right = n - 1;



	    bool flag = true;



	    for(int i = 1; i < n; ++i)



	    {



	        if(flag)



	        {



	            result[i] = res[left];



	            ++left;



	            flag = false;



	            continue;



	        }



	        else{



	            result[i] = res[right];



	            --right;



	            flag = true;



	            continue;



	        }



	    }



	    result[0] = res[left];



	    int sum = 0;



	    for(int i = 1; i < n; ++i)



	        sum += abs(result[i] - result[i-1]);



	    cout << sum << endl;



	    return0;



	}