#include <vector>#include <deque>#include <queue>#include <stack>#include <algorithm>#include <fstream>#include <iostream>#include <iomanip>#include <cstdio>#include <cmath>#include <cstdlib>#include <cstring>using namespace std;#define inf 2147480000struct hammer{ double val; double cost;}map[100010];double final[100010][2];int n;double x,y;int main(int argc, char *argv[]){ while(scanf("%d",&n)!=EOF) { cin>>x>>y; for(int i=1;i<=n;i++) cin>>map[i].cost>>map[i].val; final[n][0]=map[n].val; final[n][1]=max(1.0,map[n].val/map[n].cost); for(int i=n-1;i>=1;i--) { final[i][0]=final[i+1][0]+map[i].val*final[i+1][1]; final[i][1]=max(final[i+1][1],final[i][0]/map[i].cost); } double ans=x*final[1][1]+y*final[1][0]; printf("%.2lfn",ans); } return 0;}
