int eliminateMaximum(vector<int>& dist, vector<int>& speed) {
vector<int> time;
for(int i=0;i<dist.size();i++)
time.push_back(ceil(dist[i]/double(speed[i])));
sort(time.begin(),time.end()); //sort by arrival time
int i=0,ans=0;
for(int j=0;j<time.size();j++)
{
if(i>=time[j])
return ans;
i++;
ans++;
}
return ans;
}