洛谷大餐-re+wa

#include<bits/stdc++.h>
using namespace std;
struct mine{
	long long a,b;
};
bool cmp(mine a,mine b){
	return a.a*a.b<b.a*b.b;//按a*b从小到大排序
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
int n;
scanf("%d",&n);
long long kinga,kingb;
cin>>kinga>>kingb;
vector<mine> king(n);
for(int i=0;i<king.size();i++)cin>>king[i].a>>king[i].b;
/*paixu*/sort(king.begin(),king.end(),cmp);
long long maxcoin=INT_MIN;
long long now=kinga;//累计
for(int m=0;m<n;m++){
	long long coin=now/king[m].b;
	if(coin>maxcoin){
		maxcoin=coin;
	}
	now*=king[m].a;
}
cout<<maxcoin;
   printf("");
	return 0;
}