UVA 11559 – Event Planning

This was fun. First program so far for which I used an extra class. Easy problem. 8)

import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

/**
 * 
 * @author Sanchit M. Bhatnagar
 * @see http://uhunt.felix-halim.net/id/74004
 * 
 */
public class P11559 {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);

		while (sc.hasNextInt()) {
			int N = sc.nextInt();
			int B = sc.nextInt();
			int H = sc.nextInt();
			int W = sc.nextInt();

			Hotel[] hotels = new Hotel[H];
			for (int i = 0; i < H; i++) {
				hotels[i] = new Hotel();
				hotels[i].price = sc.nextInt();
				for (int j = 0; j < W; j++) {
					hotels[i].maxBeds = Math.max(hotels[i].maxBeds,
							sc.nextInt());
				}
			}
			Arrays.sort(hotels);
			boolean found = false;
			for (int i = 0; i < H; i++) {
				if (hotels[i].price * N <= B && hotels[i].maxBeds >= N) {
					out.println(hotels[i].price * N);
					found = true;
					break;
				}
			}
			if (!found)
				out.println("stay home");
		}
		out.close();
		sc.close();
	}

	private static class Hotel implements Comparable<Hotel> {
		int price;
		int maxBeds;

		@Override
		public int compareTo(Hotel o2) {
			if (this.price == o2.price) {
				return Integer.compare(o2.maxBeds, this.maxBeds);
			} else {
				return Integer.compare(this.price, o2.price);
			}
		}
	}

}

Leave a Reply

This site uses Akismet to reduce spam. Learn how your comment data is processed.