#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
while(cin>>n&&n)
{
map<int,int>a;
a.clear();
a[1000000000] = 1;
int id,f;
for(int i=0;i<n;i++)
{
scanf("%d%d",&id,&f);
printf("%d ",id);
map<int,int>::iterator it = a.lower_bound(f);
if(it == a.end())
printf("%d\n",it->second);
else
{
int t1 = it->first;
int t2 = it->second;
if(it != a.begin())
{
it--;
if(f - it->first <= t1 - f)
printf("%d\n",it->second);
else
printf("%d\n",t2);
}
else
printf("%d\n",t2);
}
a[f] = id;
}
}
return 0;
}
hdu 4584 map
最新推荐文章于 2018-01-26 12:20:15 发布