题目:
分析:
排序,距离大的在前
代码:
bool cmp(vector<int> &a,vector<int> &b){
return a[0] > b[0];
}
int main()
{
int t;
vector<int> position;
vector<int> speed;
if(position.size()==0) return 0;
vector<vector<int> > vv;
for(int i=0;i<position.size();i++)
{
vector<int> v;
v.push_back(position[i]);
v.push_back(speed[i]);
vv.push_back(v);
}
sort(vv.begin(),vv.end(),cmp);
for(int i=0;i<position.size();i++) cout<<vv[i][0]<<vv[i][1];
int all=0;
vector<double> v;//到达终点的时间
for(int i=0;i<vv.size();i++)
{
v.push_back((t-vv[i][0])*1.0/vv[i][1]);
}
double c=v[0];
int all=1;
for(int i=1;i<v.size();i++)
{
if(v[i]<=c) continue;
c=v[i];
all++;
}
return all;