hdu :Tian Ji -- The Horse Racing 之贪心算法

简洁易懂：

import java.io.IOError;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.text.DecimalFormat;
import java.lang.*;
import java.util.*;

public class Main {
	public static void main(String[] args) {
		Scanner in=new Scanner(new InputStreamReader(System.in));
		//DecimalFormat dt=(DecimalFormat)DecimalFormat.getInstance();
		//dt.applyPattern("0.00");
		while(in.hasNext()){
			int m=in.nextInt();
			if(m==0)
				break;
			int[] tj=new int[m];
			int[] kind=new int[m];
			for (int i = 0; i < m; i++) {
				tj[i]=in.nextInt();
			}
			for (int i = 0; i < m; i++) {
				kind[i]=in.nextInt();
			}
			Arrays.sort(tj);
			Arrays.sort(kind);
			int[] a=new int[m];
			int[] b=new int[m];
			for (int i = 0; i < m; i++) {
				a[i]=tj[m-1-i];
				b[i]=kind[m-1-i];
			}
			int i,j;
			i=m-1;
			j=m-1;
			int k=0;
			int t=0;
			int max=0;
			while(i>=k&&j>=t){
				if(a[k]>b[t]){
					k++;
					t++;
					max+=1;
				}else if(a[k]<b[t]){
					i-=1;
					t+=1;
					max-=1;
				}else if(a[k]==b[t]){
					if(a[i]>b[j]){
						i-=1;
						j-=1;
						max+=1;
					}else if(a[i]<b[j]){
						t+=1;
						i-=1;
						max-=1;
					}else if(a[i]==b[j]){
						if(a[i]<b[t]){
							max-=1;
						}
						i-=1;
						t+=1;
					}
				}
			}
			System.out.println((max*200));
		}
	}

	
}