uva 12124 - Assemble

标签：uva   算法   

#include<cstdio>
#include<cstring>
#include<vector>
#include<string>
#include<map>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 1005;
#define mem(a) memset(a,0,sizeof(a))

struct peijian{
    int p;
    int q;
}g[maxn][maxn];
map<string,int> ma;
int tt[maxn];
int t=0;
int n,b;

bool cmp(peijian aa,peijian bb){
    return aa.q<bb.q;
}

bool judge(int x)
{
    int sum=0;
    for(int i=0;i<t;i++){
        for(int j=0;j<tt[i];j++){
            if(g[i][j].q>=x){
                int m_temp=g[i][j].p;
                for(int k=j;k<tt[i];k++){
                    m_temp=min(g[i][k].p,m_temp);
                }
                sum+=m_temp;
                break;
            }
        }
    }
    if(sum<=b) return true;
    return false;
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--){
        t=0;
        mem(tt);
        scanf("%d%d",&n,&b);
        string type,name;
        int p,q,maxq=0;
        for(int i=0;i<n;i++){
            cin>>type>>name>>p>>q;
            maxq=max(maxq,q);
            if(ma.count(type)){
                int temp = ma[type];
                g[temp][tt[temp]].p=p;
                g[temp][tt[temp]++].q=q;
            }
            else{
                ma[type]=t++;
                int temp = ma[type];
                g[temp][tt[temp]].p=p;
                g[temp][tt[temp]++].q=q;
            }
        }
        for(int i=0;i<t;i++){
            sort(g[i],g[i]+tt[i],cmp);
        }
        for(int i=0;i<t;i++){
            maxq=min(maxq,g[i][tt[i]-1].q);
        }
        int left=0,right=maxq,mid;
        while(left<right){
            mid = left+(right-left+1)/2;
            if(judge(mid)){
                left=mid;
            }
            else right = mid-1;
        }
        printf("%d\n",left);
    }
    return 0;
}

uva 12124 - Assemble

标签：uva   算法   

原文地址：http://blog.csdn.net/u013382399/article/details/39050903