2013ACM-ICPC杭州赛区全国邀请赛总结

#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include <map>
#include <set>
using namespace std;
struct Point{
int id,x;
bool operator <(const Point & tem)const{
return x<tem.x;
}
};
set<Point>q;
int main()
{
int n,Id,num;
while(scanf("%d",&n)!=EOF)
{
if(n==0) break;
Point hehe;
hehe.id=1;
hehe.x=1000000000;
q.clear();
q.insert(hehe);
for(int i=2;i<=n+1;i++)
{
scanf("%d%d",&Id,&num);
hehe.id=Id;
hehe.x=num;
set<Point>::iterator now =q.lower_bound(hehe),tem1,tem2;
tem1=tem2=now;
if(tem1!=q.begin())tem1--;
int va1=(num-tem1->x),va2=(tem2->x-num);
if(va2<va1)
printf("%d %d\n",Id,tem2->id);
else
printf("%d %d\n",Id,tem1->id);
q.insert(hehe);
}
}
return 0;
}