#include <bits/stdc++.h>
template <class T>
inline T max(T a, T b) {
  return a > b ? a : b;
}
template <class T>
inline T min(T a, T b) {
  return a < b ? a : b;
}
int n, x, y, cnum;
long double curx, cury;
int conv[100500];
struct Point {
  long double x, y;
} dat[100500];
inline Point operator+(const Point &x, const Point &y) {
  return {x.x + y.x, x.y + y.y};
}
inline Point operator-(const Point &x, const Point &y) {
  return {x.x - y.x, x.y - y.y};
}
inline long double operator*(const Point &x, const Point &y) {
  return x.x * y.y - x.y * y.x;
}
inline bool operator<(const Point &x, const Point &y) {
  return x.x == y.x ? x.y < y.y : x.x < y.x;
}
inline void Getconv() {
  std::sort(dat + 1, dat + 1 + n);
  for (register int i = 1; i <= n; ++i) {
    while (cnum >= 2 && (dat[conv[cnum]] - dat[conv[cnum - 1]]) *
                                (dat[i] - dat[conv[cnum - 1]]) <=
                            0)
      --cnum;
    conv[++cnum] = i;
  }
  int lim = cnum;
  for (register int i = n - 1; i; --i) {
    while (cnum > lim && (dat[conv[cnum]] - dat[conv[cnum - 1]]) *
                                 (dat[i] - dat[conv[cnum - 1]]) <=
                             0)
      --cnum;
    conv[++cnum] = i;
  }
  if (n > 1) --cnum;
}
inline bool check() {
  Point cur = {curx, cury};
  for (register int i = 2; i <= cnum; ++i)
    if ((dat[conv[i]] - dat[conv[i - 1]]) * (cur - dat[conv[i - 1]]) < 0)
      return false;
  if ((dat[conv[1]] - dat[conv[cnum]]) * (cur - dat[conv[cnum]]) < 0)
    return false;
  return true;
}
int main(void) {
  scanf("%d%d%d", &n, &x, &y);
  long double l = 0, r = 1e6, mid, mxx = 0, mxy = 0;
  for (register int i = 1; i <= n; ++i) {
    scanf("%Lf%Lf", &dat[i].x, &dat[i].y);
    mxx = max(mxx, dat[i].x);
    mxy = max(mxy, dat[i].y);
  }
  dat[++n] = {0, 0};
  dat[++n] = {mxx, 0};
  dat[++n] = {0, mxy};
  Getconv();
  while (r - l > 1e-15) {
    mid = (l + r) / 2.0;
    curx = x * mid, cury = y * mid;
    if (check())
      l = mid;
    else
      r = mid;
  }
  printf("%.8Lf", 1.0 / mid);
}
