Submission #3595157

---

Source Code Expand

// 基本テンプレート
 
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
using namespace std;
 
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define int long long int
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
typedef pair<int, int> pii;
typedef long long ll;
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const ll INF = 1001001001001001LL;
const ll MOD = 1000000007LL;
 
int A[100010];
signed main() {
    int N; cin >> N;
    for(int i=0; i<N; i++) {
        cin >> A[i];
    }

    sort(A, A+N, greater<int>());
    
    int ans = 0;
    if(N % 2 == 0) {
        for(int i=0; i<N; i++) {
            if(i < N / 2) {
                ans += 2 * A[i];
                if(i == N/2 - 1) ans -= A[i];
            }
            else {
                ans -= 2 * A[i];
                if(i == N/2) ans += A[i];
            }
        }
    }
    else {
        int tmpA = 0, tmpB = 0;
        for(int i=0; i<N; i++) {
            // tmpA: 小さいほうが多い
            if(i < N / 2) {
                tmpA += 2 * A[i];
            }
            else {
                tmpA -= 2 * A[i];
                if(i < N / 2 + 2) tmpA += A[i];
            }

            // tmpB: 大きいほうが多い
            if(i < N / 2 + 1) {
                tmpB += 2 * A[i];
                if(i >= N / 2 - 2) tmpB -= A[i];
            }
            else {
                tmpB -= 2 * A[i];
            }
        }
        ans = max(tmpA, tmpB);
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result