Submission #19723535

---

Source Code Expand

import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;
public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = Integer.parseInt(sc.next());
		long[] A = new long[N];
		long[] B = new long[N];
		String[] C = new String[N];
		long Ao = 0;
		long Ta = 0;
		int ans = 0;
		for(int i=0 ; i<N ; i++) {
			A[i] = Long.parseLong(sc.next());
			B[i] = Long.parseLong(sc.next());
			String t = Long.toString(2*A[i]+B[i]);
			int l = t.length();
			t = "000000000000000000000000000000"+t;
			C[i] = t.substring(l-1,(30+l))+'C'+i;
			Ao += A[i];
		}
		Arrays.parallelSort(C,Comparator.reverseOrder());
		int p = 0;
		while(true) {
			int k = Integer.parseInt(C[p].substring(C[p].indexOf('C')+1));
			Ao -= A[k];
			Ta += A[k]+B[k];
			ans++;
			if(Ta>Ao) {
				break;
			}
			p++;
		}
		System.out.println(ans);
	}
}

Submission Info

Judge Result