1351 topcoder 吃点心

https://www.51nod.com/onlineJudge/questionCode.html#!problemId=1351

先按low从大到小贪心再high从小到大贪心

 #pragma comment(linker, "/STACK:1024000000,1024000000")
 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <sstream>
 #include <string>
 #include <algorithm>
 #include <list>
 #include <map>
 #include <vector>
 #include <queue>
 #include <stack>
 #include <cmath>
 #include <cstdlib>
 // #include <conio.h>
 using namespace std;
 #define clc(a,b) memset(a,b,sizeof(a))
 #define inf 0x3f3f3f3f
 #define lson l,mid,rt<<1
 #define rson mid+1,r,rt<<1|1
 const int N=;
 const int MOD = 1e9+;
 #define LL long long
 double const pi = acos(-);
 void fre() {
     freopen("in.txt","r",stdin);
 }
 // inline int r() {
 //     int x=0,f=1;char ch=getchar();
 //     while(ch>'9'||ch<'0') {if(ch=='-') f=-1;ch=getchar();}
 //     while(ch>='0'&&ch<='9') { x=x*10+ch-'0';ch=getchar();}return x*f;
 // }
 struct  node{
      int x,y;
 }p[];

 bool cmp1(const node &a,const node &b){
      return a.x>b.x;
 }

 bool cmp2(const node &a,const node &b){
      return a.y<b.y;
 }

 int main(){
     // fre();
     int T;
     scanf("%d",&T);
     while(T--){
          int n,c,x;
          scanf("%d%d%d",&n,&c,&x);
          for(int i=;i<n;i++){
              scanf("%d%d",&p[i].x,&p[i].y);
          }
          sort(p,p+n,cmp1);
          int sum=,ans1=;
          for(int i=;i<n;i++){
              if(sum<x)
                  ans1++,sum+=p[i].x;
              else
                 break;
          }
          int ans2=n;
          sort(p,p+n,cmp2);
          for(int i=;i<n;i++){
              if(c-p[i].y>=x){
                 ans2--,c-=p[i].y;
              }
              else
                 break;
          }
          printf("%d\n",min(ans1,ans2));
     }
     return ;
 }