結果

問題 No.972 選び方のスコア
ユーザー k_6101k_6101
提出日時 2020-01-18 17:03:35
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,038 ms / 2,000 ms
コード長 4,199 bytes
コンパイル時間 2,583 ms
コンパイル使用メモリ 90,008 KB
実行使用メモリ 66,800 KB
最終ジャッジ日時 2023-09-10 04:20:52
合計ジャッジ時間 29,113 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,038 ms
65,072 KB
testcase_01 AC 980 ms
65,304 KB
testcase_02 AC 916 ms
64,924 KB
testcase_03 AC 702 ms
61,040 KB
testcase_04 AC 941 ms
65,028 KB
testcase_05 AC 948 ms
64,800 KB
testcase_06 AC 965 ms
65,108 KB
testcase_07 AC 854 ms
65,268 KB
testcase_08 AC 830 ms
66,800 KB
testcase_09 AC 830 ms
64,996 KB
testcase_10 AC 827 ms
64,424 KB
testcase_11 AC 888 ms
65,180 KB
testcase_12 AC 874 ms
64,656 KB
testcase_13 AC 882 ms
64,964 KB
testcase_14 AC 853 ms
64,672 KB
testcase_15 AC 888 ms
62,864 KB
testcase_16 AC 856 ms
65,244 KB
testcase_17 AC 891 ms
64,772 KB
testcase_18 AC 126 ms
55,784 KB
testcase_19 AC 941 ms
66,032 KB
testcase_20 AC 977 ms
64,576 KB
testcase_21 AC 949 ms
64,808 KB
testcase_22 AC 941 ms
64,832 KB
testcase_23 AC 899 ms
65,592 KB
testcase_24 AC 940 ms
64,348 KB
testcase_25 AC 127 ms
55,756 KB
testcase_26 AC 126 ms
55,600 KB
testcase_27 AC 127 ms
55,756 KB
testcase_28 AC 126 ms
55,740 KB
testcase_29 AC 125 ms
56,052 KB
testcase_30 AC 129 ms
55,904 KB
testcase_31 AC 129 ms
55,840 KB
testcase_32 AC 128 ms
55,584 KB
testcase_33 AC 148 ms
55,956 KB
testcase_34 AC 141 ms
55,812 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedWriter;
import java.io.FileWriter;
import java.io.InputStream;
import java.io.PrintWriter;
import java.lang.reflect.Array;
import java.math.BigDecimal;
import java.math.MathContext;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.Deque;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Random;
import java.util.Scanner;
import java.util.Set;
import java.util.Stack;
import java.util.TreeMap;
import java.util.TreeSet;

import static java.util.Comparator.*;

public class Main {
    public static void main(String[] args) {
        PrintWriter out = new PrintWriter(System.out);
        Solver solver = new Solver(System.in, out);
        solver.solve();
        out.close();
    }
}
class Solver {
	Scanner sc;
	PrintWriter out;
    public Solver(InputStream in, PrintWriter out) {
    	sc = new Scanner(in);
    	this.out = out;
    }
    // ==========================================================
	int N;
	int[] A;
	boolean check(int cnt, int center) {
		long val = (long)A[center - cnt] + (long)A[N - cnt] - (long)A[center] * 2;
//		out.println("A[" + (center - cnt) + "] = " + A[center - cnt]
//				+ " + A[" + (N-cnt) + "] = " + A[N - cnt]
//				+ " - A[" + center + "] = " + A[center]
//				+ " * 2  -->  val = " + val);
		if(val >= 0)	return true;
		else			return false;
	}
	int calc(int l, int r, int center) {
//		out.println("calc start  l = " + l + "  r = " + r + "  center = " + center);
		int mid;
		while(Math.abs(l - r) > 1) {
			mid = (l + r) / 2;
//			out.println("---> call check  l = " + l + "  r = " + r + "  mid = " + mid);
			if(check(mid, center))	l = mid;
			else					r = mid;
		}
//		out.println(" return " + l);
		return l;
	}
	public void solve() {
		N = ni();
		A = ndi(N);
		if(N <= 2) {
			out.println(0);
			return;
		}
		Arrays.sort(A);
		long[] wa = new long[N+1];
		for (int i = 0; i < N; i++) {
			wa[i+1] = wa[i] + A[i];
		}
		int k;
		long ans = 0, wk;
		for (int i = 1; i < N - 1; i++) {
			k = calc(0, Math.min(i, N - i - 1)+1, i);
			wk = wa[i] - wa[i-k] + wa[N] - wa[N-k] - (long)A[i] * k * 2;
//			out.println("計算　(wa[" + i + "] = " + wa[i] 
//						+ "])  - (wa[" + (i-k) + "] = " + wa[i-k] 
//						+ ") + (wa[" + N + "] = " + wa[N] 
//						+ "]) - wa[" + (N-k) + "] = " + wa[N-k] 
//						+ ") - (A[" + i + "] = " + A[i] + ") * " + k + " * 2 = "
//						+ wk + "\n");
			ans = Math.max(ans, wk);
		}
		out.println(ans);
    }
    // Set に入れるなら　PPKEY　を使う！
    static class PP{
    	public int key, val;
    	public PP(int key, int val) {
    		this.key = key;
    		this.val = val;
    	}
		public int getKey() {
			return key;
		}
		public void setKey(int key) {
			this.key = key;
		}
		public int getVal() {
			return val;
		}
		public void setVal(int val) {
			this.val = val;
		}
    }
    // ------------------------------------------
    // 入力
    // ------------------------------------------
    public int ni() {
    	return sc.nextInt();
    }
    public long nl() {
    	return sc.nextLong();
    }
    public String ns() {
    	return sc.next();
    }
    public char[] nc() {
    	return sc.next().toCharArray();
    }
    public int[] ndi(int N) {
    	int[] ans = new int[N];
    	for (int i = 0; i < N; i++) {
			ans[i] = ni();
		}
    	return ans;
    }
    public long[] ndl(int N) {
    	long[] ans = new long[N];
    	for (int i = 0; i < N; i++) {
			ans[i] = nl();
		}
    	return ans;
    }
    public String[] nds(int N) {
    	String[] ans = new String[N];
    	for (int i = 0; i < N; i++) {
			ans[i] = ns();
		}
    	return ans;
    }
    public char[][] ndc(int N) {
    	char[][] ans = new char[N][];
    	for (int i = 0; i < N; i++) {
			ans[i] = nc();
		}
    	return ans;
    }
    public int[][] nddi(int N, int S) {
    	int[][] ans = new int[N][S];
    	for (int i = 0; i < N; i++) {
			for (int j = 0; j < S; j++) {
				ans[i][j] = ni();
			}
		}
    	return ans;
    }
}
0