AOJ0159 The Best Body

問題リンク The Best Body

• 解法

やるだけ問題です。

• ソース

import java.util.Scanner;

//The Best Body
public class AOJ0159 {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		while(true){
			int n = sc.nextInt();
			if(n==0)break;
			int id = sc.nextInt();
			double h = sc.nextDouble()/100;
			double w = sc.nextDouble();
			double b = Math.abs(22-(w/(h*h)));
			for(int i=1;i<n;i++){
				int x = sc.nextInt();
				h = sc.nextDouble()/100;
				w = sc.nextDouble();
				double a = Math.abs(22-(w/(h*h)));
				if(a<b){
					b = a;
					id = x;
				}
				else if(a==b&&x<id)id = x;
			}
			System.out.println(id);
		}
	}
}