#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
using namespace std;
const long long mod=1000000007;
const long long inf=mod*mod;
const long long d2=500000004;
const double EPS=1e-6;
const double PI=acos(-1.0);
int ABS(int a){return max(a,-a);}
long long ABS(long long a){return max(a,-a);}
int p[110000];
int q[110000];
int main(){
int a;
long long b;scanf("%d%lld",&a,&b);
int ma=0;
for(int i=0;i<a;i++){
scanf("%d%d",p+i,q+i);
ma=max(ma,p[i]);
}
int ret=mod;
int tmp=0;
std::sort(q,q+a);
for(int i=a;i>=0;i--){
if(i){
b-=q[i-1];
tmp++;
}
int cost=0;
if(b>0){
cost=(b+ma-1)/ma;
}
ret=min(ret,tmp+cost);
}
printf("%d\n",ret);
}
./Main.cpp: In function ‘int main()’:
./Main.cpp:28:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
long long b;scanf("%d%lld",&a,&b);
^
./Main.cpp:31:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",p+i,q+i);
^