1009 -

最新推荐文章于 2025-07-19 12:21:01 发布

原创最新推荐文章于 2025-07-19 12:21:01 发布 · 224 阅读

0 ·

CC 4.0 BY-SA版权

杭电ACM-Java 专栏收录该内容

5 篇文章

订阅专栏

本文介绍了一个Java实现的ACM编程挑战题解，主要内容包括通过读取输入并使用自定义类进行排序来解决资源分配问题。代码示例展示了如何处理输入数据、排序和计算最优解。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

http://acm.hdu.edu.cn/showproblem.php?pid=1009

如下写法会导致PE

System.out.format("%.3f\n", sum);

import java.awt.image.ImageConsumer;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {

		Scanner input = new Scanner(System.in);

		while (true) {
			int M = input.nextInt();
			int N = input.nextInt();
			if (M == -1 && N == -1) {
				return;
			}

			List<Room> rooms = new ArrayList<>();
			double sum = 0;

			for (int i = 0; i < N; i++) {
				Room room = new Main().new Room(input.nextInt(), input.nextInt());
				rooms.add(room);
			}

			Collections.sort(rooms);

			for (Room room : rooms) {
				if (M == 0) {
					break;
				}
				if (M >= room.getCatFood()) {
					M -= room.getCatFood();
					sum += room.getJavaBean();
				} else {
					sum += M * 1.0 / room.getCatFood() * room.getJavaBean();
					M = 0;
				}
			}
			System.out.format("%.3f", sum);
			System.out.println();
		}

	}

	class Room implements Comparable<Room> {

		private int javaBean;
		private int catFood;
		private double x;

		public Room(int j, int f) {
			this.javaBean = j;
			this.catFood = f;
			this.x = javaBean * 1.0 / catFood;
		}

		public int getJavaBean() {
			return javaBean;
		}

		public void setJavaBean(int javaBean) {
			this.javaBean = javaBean;
		}

		public int getCatFood() {
			return catFood;
		}

		public void setCatFood(int catFood) {
			this.catFood = catFood;
		}

		public double getX() {
			return x;
		}

		public void setX(double x) {
			this.x = x;
		}

		@Override
		public int compareTo(Room o) {
			return this.getX() > o.getX() ? -1 : 1;
		}

		@Override
		public String toString() {
			return String.format("%s %s %s", this.javaBean, this.catFood, this.x);
		}

	}

}