CF1217B Zmei Gorynich(贪心)

传送门
题意：t组数据，n个技能，刚开始恶龙有x个头，每个技能di,hi,意思是可以砍掉di个头，然后有长出了hi个头
贪心，找个实际砍掉头的最大值
特殊情况进行特判

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <vector>
#include <math.h>
#include <map>
#include <queue>
#define maxn 1000005
#define M(x,y) make_pair(x,y)
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
const int N=1e6+50;
int n,x;
struct sa
{
    int x;
    int y;
    int k;
}p[1001];
int cmp(sa a,sa b)
{
    return a.k>b.k;
}
int main()
{
    //freopen("in.txt","r",stdin);
    int t;
    cin>>t;
    while(t--)
    {
        cin>>n>>x;
        int ma=-9999999;
        for(int i=1;i<=n;i++)
        {
            cin>>p[i].x>>p[i].y;
            p[i].k=p[i].x-p[i].y;
            ma=max(ma,p[i].x);
        }
        sort(p+1,p+n+1,cmp);
        if(ma<x&&p[1].k<=0)
        {
            cout<<"-1"<<endl;
            continue;
        }
        int ans=0;
        x-=ma;
        ans=1;
 
        if(x<=0)
        {
            cout<<ans<<endl;
            continue;
        }
        //cout<<ceil(1.0*x/p[1].k)<<endl;
        ans+=ceil(1.0*x/p[1].k);
        cout<<ans<<endl;
    }
    return 0;
}