60分，求救，必关

#include <bits/stdc++.h>
using namespace std;
struct Minister {
    long long l, r;  // 左手、右手
};
bool cmp(const Minister& a, const Minister& b) {
    return a.l * a.r < b.l * b.r;
}
int main() {
    int n;
    cin >> n;
    long long king_l, king_r;
    cin >> king_l >> king_r;
    vector<Minister> mins(n);
    for (int i = 0; i < n; ++i) {
        cin >> mins[i].l >> mins[i].r;
    }  
    sort(mins.begin(), mins.end(), cmp);
    long long max_gold = 0;
    long long prefix = king_l;
    for (int i = 0; i < n; ++i) {
        long long gold = prefix / mins[i].r;
        if (gold > max_gold) {
            max_gold = gold;
        }
        prefix *= mins[i].l;
    }
    
    cout << max_gold << endl;
    return 0;
}