Submission #1949495

---

Source Code Expand

#include <iostream>
using namespace std;
#include<string.h>
#include<set>
#include<stdio.h>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstring>
#include <cstdio>
#include <cstdlib>
#include<stack>
#include<vector>
struct lll
{
    int x,y;
}a[110000];
int cmp(lll s1,lll s2)
{
    return s1.y>s2.y;
}
int main()
{
    int n,m;
    cin>>n>>m;
    int sum=0;
    int add=0;
    int max1=0;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i].x>>a[i].y;
        max1=max(max1,a[i].x);
    }
    sort(a+1,a+1+n,cmp);
    for(int i=1;i<=n;i++)
    {
        if(a[i].y<max1)
            break;
        sum+=a[i].y;
        add++;
        if(sum>=m)
        {
            cout<<add<<endl;
            return 0;
        }
    }
    int t;
    if((m-sum)%max1==0)
        t=(m-sum)/max1;
    else
        t=(m-sum)/max1+1;
    cout<<add+t<<endl;
    return 0;
}

Submission Info

Judge Result