2007年北欧ACM比赛A题(最小值最大，二分)

Problem A - Assemble

Time limit: 2 seconds

Recently your team noticed that the computer you use to practice for programming contests is not good enough anymore. Therefore, you decide to buy a new computer.

To make the ideal computer for your needs, you decide to buy separate components and assemble the computer yourself. You need to buy exactly one of each type of component.

The problem is which components to buy. As you all know, the quality of a computer is equal to the quality of its weakest component. Therefore, you want to maximize the quality of the component with the lowest quality, while not exceeding your budget.

Input

On the first line one positive number: the number of testcases, at most 100. After that per testcase:

• One line with two integers: 1 ≤ n ≤ 1000, the number of available components and 1 ≤b ≤ 1000000000, your budget.
• n lines in the following format: ``type name price quality'', wheretype is a string with the type of the component,name is a string with the unique name of the component,price is an integer (0 ≤price < 1000000) which represents the price of the component andquality is an integer (0 ≤quality ≤ 1000000000) which represents the quality of the component (higher is better). The strings contain only letters, digits and underscores and have a maximal length of 20 characters.

It will always possible to construct a computer with your budget.

Output

Per testcase:

• One line with one integer: the maximal possible quality.

Sample Input

1
18 800
processor 3500_MHz 66 5
processor 4200_MHz 103 7
processor 5000_MHz 156 9
processor 6000_MHz 219 12
memory 1_GB 35 3
memory 2_GB 88 6
memory 4_GB 170 12
mainbord all_onboard 52 10
harddisk 250_GB 54 10
harddisk 500_FB 99 12
casing midi 36 10
monitor 17_inch 157 5
monitor 19_inch 175 7
monitor 20_inch 210 9
monitor 22_inch 293 12
mouse cordless_optical 18 12
mouse microsoft 30 9
keyboard office 4 10

Sample Output

9

The 2007 ACM Northwestern European Programming Contest 

题意：有b块钱，组装一台电脑，给出n个配件种类，品质因子，价格，要求每种买一个，总价格不能超过b元，而且品质最差的配件品质因子尽量大

思路：就是最小值最大问题，常用方法是二分，假设答案是x，我们如何判断x是最小还是最大呢，删除品质因子小于x的所有配件，如果还能组装出来不超过b元的电脑，那么ans>=x，否则ans<x，所以我们可以对品质因子进行二分求解。

#pragma warning( disable: 4786 )
#include <iostream>
#include <string>
#include <cstdio>
#include <map>
#include <vector>
using namespace std;

#define MAXN 1010
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))

struct Component 
{
	int price;
	int quality;
};

int cnt;
int n, b;//数量预算
map<string, int> id;
vector<Component> comp[MAXN];


int ID(string s)
{
	if (!id.count(s)) id[s] = cnt ++;
	return id[s];
}

bool ok(int q)//品质因子不小于q的组件能否组成不超过b元的电脑
{
	int sum = 0;
	for (int i = 0; i < cnt; i++)//cnt种配件
	{
		int cheapter = b + 1;
		for (int j = 0; j < comp[i].size(); j++)//每种size个
		{
			if (comp[i][j].quality >= q) cheapter = MIN(cheapter, comp[i][j].price);
		}
		if (cheapter == b + 1) return false;//第i种配件不能选取
		sum += cheapter;
		if (sum > b) return false;
	}
	return true;
}

int main()
{
	int T;
	cin>>T;
	while (T--)
	{
		cin>>n>>b;
		cnt = 0;
		for (int i = 0; i < n; i++)
			comp[i].clear();
		id.clear();

		int maxq = 0;
		int p, q;
		char name[30], type[30];
		for (i = 0; i < n; i++)
		{
			scanf("%s%s%d%d", type, name, &p, &q);
			maxq = MAX(maxq, q);
			Component c;
			c.price = p;
			c.quality = q;
			comp[ID(type)].push_back(c);
		}

		//二分
		int L = 0, R = maxq;
		while (L < R)
		{
			int M = L + (R - L + 1) / 2;
			if (ok(M)) L = M;
			else R = M - 1;
		}
		printf("%d\n", L);
	}
	return 0;
}