SHoj 420 购买装备

#define _CRT_SECURE_NO_DEPRECATE
#include<iostream>
#include<algorithm>
#include<queue>
#include<set>
#include<vector>
#include<cstring>
using namespace std;
typedef long long ll;
#define INF 0x3f3f3f3f
const int N_MAX = 100000+4;
int t,n;//n件装备，m个金币
ll m;
int num = 0;//num为购买装备数
int SXZ[N_MAX];
struct zhuangbei {
int a, b;//ai属性值，bi金币
zhuangbei() {}
zhuangbei(int a,int b):a(a),b(b){
}
bool operator <(const zhuangbei &B)const {
    if (this->b != B.b) return this->b < B.b;
    else return this->a > B.a;
}
}zb[N_MAX];

bool C(int shuxing) {
    ll sum =0;
    int res=0;//买的装备数
    for (int i = 0; i < n;i++) {
        if (sum+zb[i].b<=m) {//装备价格能接受
            if (zb[i].a>=shuxing) {//且当前装备属性值大于等于最低属性值，买
                sum += zb[i].b;
                res++;
                if (res >= num)break;//能买的装备足够多了
            }
        }
        else break;
    }
    if (res<num)return false;//能挑选的数量太少，说明属性值还应该低一些
    else return true;
}


int main() {
    scanf("%d",&t);
    while (t--) {
        num = 0;
        scanf("%d%lld",&n,&m);
        for (int i = 0; i < n;i++) {
            scanf("%d%d",&zb[i].a,&zb[i].b);
            SXZ[i] = zb[i].a;
        }
        sort(zb, zb + n);
        sort(SXZ,SXZ+n);//对属性值从小到大排,二分出来的属性值必须是其中之一
        ll add = 0;
        for (int i = 0; i < n;i++) {
            add += zb[i].b;
            if (add <= m)num++;
        }
        int lb = 0, ub = n;
        while (ub-lb>1) {
            int mid = (ub+lb)>>1;
            if (C(SXZ[mid]))lb = mid;
            else ub = mid;
        }
        printf("%d %d\n",num,SXZ[lb]);

    }
        return 0;
}