uva12124 Assemble

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 rst 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 ‘, where type 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 and quality 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.

二分品质最小值，然后从所有配件中选择能选的【品质不小于二分值的】费用最小的，看是否可行。

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<map>
#include<vector>
#include<iostream>
using namespace std;
const int oo=0x3f3f3f3f;
int n,m,b;
vector<pair<int,int> > v[1010];
map<string,int> mp;
void init()
{
    int i,x,y;
    string s;
    mp.clear();
    m=0;
    scanf("%d%d",&n,&b);
    for (i=1;i<=n;i++)
    {
        cin>>s;
        scanf("%*s%d%d",&x,&y);
        if (!mp.count(s))
        {
            mp[s]=++m;
            v[m].clear();
        }
        v[mp[s]].push_back(make_pair(x,y));
    }
}
bool ok(int x)
{
    int i,j,ans=0,tem;
    for (i=1;i<=m;i++)
    {
        tem=oo;
        for (j=0;j<v[i].size();j++)
          if (v[i][j].second>=x)
            tem=min(tem,v[i][j].first);
        if (tem==oo) return 0;
        ans+=tem;
    }
    return ans<=b;
}
int main()
{
    int T,l,r,mid;
    scanf("%d",&T);
    while (T--)
    {
        init();
        l=0;
        r=1000000000;
        while (l<r)
        {
            mid=(l+r+1)/2;
            if (ok(mid)) l=mid;
            else r=mid-1;
        }
        printf("%d\n",l);
    }
}