UVALive - 3971——Assemble

题目链接：https://cn.vjudge.net/problem/UVALive-3971#author=634579757

思路：二分找最小值最大。

#include<algorithm>
#include<string.h>
#include<cstdio>
#include<iostream>
#include<map>
using namespace std;
map<string,int>mp;
int t,n,b,maxx,carry;
int flag[1010];
string str,sty;
struct node
{
    int kind,v,h;
} A[1010];
void init()
{
    maxx=carry=0;
    mp.clear();
}
int f(int k,int m)
{
    long long total=0;
    memset(flag,0x3f,sizeof(flag));
    for(int i=1; i<=n; i++)
    {
        if(A[i].h>=k)
        {
            flag[A[i].kind]=min(flag[A[i].kind],A[i].v);
        }
    }
    for(int i=1; i<=carry; i++)
    {
        total+=flag[i];
    }
    if(total<=(long long)m) return 1;
    return 0;
}
int main()
{
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&b);
        init();
        for(int i=1; i<=n; i++)
        {
            cin>>str>>sty>>A[i].v>>A[i].h;
            if(!mp[str])
                mp[str]=++carry;
            A[i].kind=mp[str];
            maxx=max(maxx,A[i].h);
        }
        int l=0,r=maxx,mid;
        while(l<=r)
        {
            mid=(l+r)>>1;
            if(f(mid,b))
                l=mid+1;
            else
                r=mid-1;
        }
        printf("%d\n",r);
    }
}