Untitled

void solve() {
    ll n, x1, x2;
    cin >> n >> x1 >> x2;
    pll v[n];
    for (int i = 0; i < n; ++i) {
        ll k, b;
        cin >> k >> b;
        v[i] = {k * x1 + b, k * x2 + b};
    }
    sort(v, v + n);
    for (int i = 1; i < n; ++i) {
        if(v[i].fi > v[i - 1].fi && v[i].se < v[i - 1].se) {
            cout << "YES";
            return;
        }
    }
    cout << "NO";
}