HDOJ FatMouse' Trade JAVA 1009
来源:互联网 发布:超级本 知乎 编辑:程序博客网 时间:2024/06/05 20:47
简单的贪心问题
但不知道为什么 用Decimal输出的不能AC
只能用printf的格式输出,AC了
package _1009;import java.text.DecimalFormat;import java.util.Collections;import java.util.LinkedList;import java.util.List;import java.util.Scanner;class jf implements Comparable<jf>{int j,f;double avg;jf(int a,int b,double c){j=a;f=b;avg=c;}public int compareTo(jf o) {if(this.avg-o.avg > 0.001)return -1;elsereturn 1;}}public class Main {static List<jf> list ;public static void main(String[] args) {Scanner sc = new Scanner(System.in);while(sc.hasNext()){int m = sc.nextInt();int n = sc.nextInt();if(m==-1&&n==-1) break;list = new LinkedList<jf>();for (int i = 0; i < n; i++) {int j,f;j = sc.nextInt();f = sc.nextInt();list.add(new jf(j,f,(double)j/f));}Collections.sort(list);double sum = 0;for (int i = 0; i < list.size(); i++) {if(m>=list.get(i).f){sum += list.get(i).j;m -= list.get(i).f;}else{sum += list.get(i).avg*m;break;}}//DecimalFormat df = new DecimalFormat("0.000");//System.out.println(df.format(sum));System.out.printf("%.3f",sum);System.out.println();}}}
FatMouse' Trade
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 83869 Accepted Submission(s): 29046
Problem Description
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.
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
5 37 24 35 220 325 1824 1515 10-1 -1
Sample Output
13.33331.500
Author
CHEN, Yue
Source
ZJCPC2004
Recommend
JGShining
阅读全文
0 0
- HDOJ FatMouse' Trade JAVA 1009
- HDOJ 1009 FatMouse' Trade
- HDOJ 1009 FatMouse' Trade
- hdoj 1009 FatMouse' Trade
- HDOJ 1009 FatMouse' Trade
- hdoj 1009 FatMouse' Trade
- HDOJ 1009 FatMouse' Trade
- hdoj 1009 FatMouse' Trade
- HDOJ 1009 FatMouse' Trade
- HDOJ-1009-FatMouse' Trade
- HDOJ 1009 FatMouse' Trade
- hdoj 1009 FatMouse' Trade
- HDOJ 1009 FatMouse' Trade
- HDOJ 1009 FatMouse' Trade
- HDOJ 1009 FatMouse' Trade
- HDOJ: 1009FatMouse' Trade
- hdoj 1009 FatMouse' Trade 【贪心】
- hdoj 1009 FatMouse' Trade【贪心】
- jiecaovideoplayer的简单使用
- 堆排序
- Visual studio 插件推荐
- 《深入理解计算机系统》—优化程序性能
- 【Scikit-Learn 中文文档】9 高斯过程
- HDOJ FatMouse' Trade JAVA 1009
- 仿京东分类实现
- 网站开发中有利于SEO优化的方法
- ijkplayer的使用解析-视频播放,直播
- angular js 循环数据(死数据) 添加数据 隔行换色 单个删除 排序
- 基于Restful接口的网络API接口调用方法
- 【Scikit-Learn 中文文档】10 交叉分解
- 怎样在SQL语句中使用EXISTS, UNIQUE, DISTINCT, 和OVERLAPS
- PullToRefresh 下拉刷新的时候再滑动,报IndexOutOfBoundsException