题目信息:http://acm.hdu.edu.cn/showproblem.php?pid=2545
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
struct pine {
double s,e;
int h;
} a[100005];
bool cmp(pine a,pine b) {
return a.s<b.s;
}
int main() {
int n,T,A;
while(~scanf("%d",&n)&&n) {
for(int i=0; i<n; i++)
scanf("%lf%d",&a[i].s,&a[i].h);
scanf("%d/%d",&T,&A);
for(int i=0; i<n; i++) {
a[i].e=a[i].s+1.0*a[i].h*A/T;
}
sort(a,a+n,cmp);
double t=a[0].e;
int cnt=0;
for(int i=1; i<n; i++) {
if(a[i].e<=t)
cnt++;
else
t=a[i].e;
}
printf("%d\n",n-cnt);
}
}