UVA 3971 Assemble -

题目地址：http://vjudge.net/problem/UVALive-3971

#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<=(int)(b);++i)
const int maxn=1000+3,INF=0x3f3f3f3f;	
std::map<string, int> ID;
struct Component
{
	int price,quality;
};
std::vector<std::vector<Component> > pc(maxn);
int n,b;
bool Check(int MinQ){
	int MinP=0,temp;
	REP(i,0,ID.size()-1){
		temp=INF;
		REP(j,0,pc[i].size()-1) if(pc[i][j].quality>=MinQ) temp=min(temp,pc[i][j].price); 
		MinP+=temp;
		if(temp>=INF||MinP>b) return false;
	}
	return true;
}
int BinarySearch(int L,int R){
	while(L<R){
		int mid=L+((R-L+1)>>1);  //加括号
		if(Check(mid)) L=mid;
		else R=mid-1;
		
	}
	return L;
}
int main(int argc, char const *argv[])
{
	int O_O; scanf("%d",&O_O);
	while(O_O--)
	{
		scanf("%d %d",&n,&b);

		ID.clear(); REP(i,0,n) pc[i].clear();
		int MaxQ=-INF,MinQ=INF;
		REP(i,1,n){
			char cp[25]; int id,p,q;
			scanf("%s",cp);
			if(ID.count(string(cp))) id=ID[cp];
			else id=ID.size(),ID[cp]=id;
			scanf("%s%d%d",cp,&p,&q);
			pc[id].push_back(Component{p,q});
			MinQ=min(MinQ,q); MaxQ=max(MaxQ,q);
		}
		printf("%d\n",BinarySearch(MinQ,MaxQ));
	}
	return 0;
}