[Java] HDU-1009

Tizzii

于 2019-08-15 13:49:29 发布

阅读量326

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/qq_41280600/article/details/99632421

版权

算法专栏收录该内容

54 篇文章 1 订阅

订阅专栏

一、内容

FatMouse’ Trade

 FatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean.
The warehouse has N rooms. The i-th room contains J[i] pounds of JavaBeans and requires F[i] pounds of cat food. FatMouse does not have to trade for all the JavaBeans in the room, instead, he may get J[i]* a% pounds of JavaBeans if he pays F[i]* a% pounds of cat food. Here a is a real number. Now he is assigning this homework to you: tell him the maximum amount of JavaBeans he can obtain.

Input

The input consists of multiple test cases. Each test case begins with a line containing two non-negative integers M and N. Then N lines follow, each contains two non-negative integers J[i] and F[i] respectively. The last test case is followed by two -1's. All integers are not greater than 1000.

Output

For each test case, print in a single line a real number accurate up to 3 decimal places, which is the maximum amount of JavaBeans that FatMouse can obtain.

Sample Input

Sample Output

13.333
31.500

二、思路

按照J/F的比值进行排序，每次从最大的开始选取，若当前的钱大于F，直接加上所以的J，若不大于就进行分割
注意输出格式，不要四舍五入，而是直接保留小数点后三位。

三、代码

import java.util.*;

public class HDU_1009 { 
	static int n, m;
	static N[] rec;
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		while (true) {
			n  = sc.nextInt();
			m = sc.nextInt();
			if (n == -1 && m == -1) {
				return;
			}
			rec = new N[m];
			double a, b;
			for (int i = 0; i < m; i++) {
				a = sc.nextDouble();
				b = sc.nextDouble();
				rec[i] = new N(a, b);
			}
			Arrays.sort(rec);
			double ans = 0;
			for (int i = 0; i < m; i++) {
				if (rec[i].f <= n) {
					n -= rec[i].f;
					ans += rec[i].j ;
				} else { 
					ans += n * rec[i].j  / rec[i].f;
					break;
				}
			}
			System.out.printf("%.3f \n",ans);
		}
	}
}
class N implements Comparable<N> {
	double j, f;

	public N(double j, double f) {
		this.j = j;
		this.f = f;
	}

	public int compareTo(N o) {
		double a1 = j  / f;
		double a2 = o.j  / o.f;
		return a1 >= a2 ? -1 : 1;
	}
}