#include <bits/stdc++.h>
using namespace std;
int n, st[100010], top;
double mx, my, A, B;
struct point {
  double x, y;
} p[100010];
struct line {
  point p, v;
};
inline double dis(point a, point b) {
  return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));
}
inline point operator+(point a, point b) {
  return (point){a.x + b.x, a.y + b.y};
}
inline point operator-(point a, point b) {
  return (point){a.x - b.x, a.y - b.y};
}
inline double operator*(point a, point b) { return a.x * b.y - a.y * b.x; }
inline bool operator<(point a, point b) {
  double t = (a - p[0]) * (b - p[0]);
  if (t != 0) return t < 0;
  return dis(p[0], a) < dis(p[0], b);
}
inline point operator*(point a, double b) { return (point){a.x * b, a.y * b}; }
inline point intersect(line l1, line l2) {
  point u = l1.p - l2.p;
  double tmp = (l2.v * u) / (l1.v * l2.v);
  return l1.p + l1.v * tmp;
}
int main() {
  scanf("%d%lf%lf", &n, &A, &B);
  for (int i = 1; i <= n; i++) {
    scanf("%lf%lf", &p[i].x, &p[i].y);
    mx = max(mx, p[i].x);
    my = max(my, p[i].y);
  }
  p[0] = (point){0, 0};
  p[++n] = (point){mx, 0};
  p[++n] = (point){0, my};
  sort(p + 1, p + n + 1);
  st[++top] = 0;
  st[++top] = 1;
  for (int i = 2; i <= n; i++) {
    while (top > 1 && (p[i] - p[st[top]]) * (p[st[top]] - p[st[top - 1]]) <= 0)
      top--;
    st[++top] = i;
  }
  int now;
  for (int i = top; i >= 2; i--) {
    if (p[st[i]].y * A >= p[st[i]].x * B) {
      now = i;
      break;
    }
  }
  point tmp = intersect((line){(point){0, 0}, (point){A, B}},
                        (line){p[st[now + 1]], p[st[now]] - p[st[now + 1]]});
  printf("%.7lf\n", A / tmp.x);
  return 0;
}
