HDU4585少林寺 极简代码

Shaolin temple is very famous for its Kongfu monks.A lot of young men go to Shaolin temple every year, trying to be a monk there. The master of Shaolin evaluates a young man mainly by his talent on understanding the Buddism scripture, but fighting skill is also taken into account.
When a young man passes all the tests and is declared a new monk of Shaolin, there will be a fight , as a part of the welcome party. Every monk has an unique id and a unique fighting grade, which are all integers. The new monk must fight with a old monk whose fighting grade is closest to his fighting grade. If there are two old monks satisfying that condition, the new monk will take the one whose fighting grade is less than his.
The master is the first monk in Shaolin, his id is 1，and his fighting grade is 1,000,000,000.He just lost the fighting records. But he still remembers who joined Shaolin earlier, who joined later. Please recover the fighting records for him.

There are several test cases.
In each test case:
The first line is a integer n (0 <n <=100,000),meaning the number of monks who joined Shaolin after the master did.(The master is not included).Then n lines follow. Each line has two integer k and g, meaning a monk’s id and his fighting grade.( 0<= k ,g<=5,000,000)
The monks are listed by ascending order of jointing time.In other words, monks who joined Shaolin earlier come first.
The input ends with n = 0.
A fight can be described as two ids of the monks who make that fight. For each test case, output all fights by the ascending order of happening time. Each fight in a line. For each fight, print the new monk’s id first ,then the old monk’s id.
题目的大体意思就是和尚一个个加入到少林寺，入寺时候会和老和尚打一架，找到战斗力相差最近的老和尚打一架就行。
很容易联想到使用map，第一位表示的是战斗力grade，第二维表示和尚的id，然后每次加入一个新和尚，插入即可，map内部是排好序的，因此我们只要和左右两侧比较就行了。同时可能存在新和尚是战斗力最小的那个，需要特判，没有比方丈战斗力还高的和尚了（方丈yyds），因此右边界不需要考虑。
当然，这道题也能自己写一个Treap树完成操作，但远远没有使用库函数来的简洁，因此我十分推荐使用这个方法。
代码如下

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int n;
	while(scanf("%d",&n)!=EOF&&n)
	{
		map<long,long> monk;第一维是战斗力，第二维是id
		monk[1000000000]=1;
		for(int i=1;i<=n;i++)
		{
			long a,b;
			scanf("%ld%ld",&a,&b);
			monk[b]=a;
			map<long,long>::iterator it=monk.find(b);//简单使用一下迭代器即可
			if(it==monk.begin())
			printf("%ld %ld\n",a,(++it)->second);
			else 
			{
				map<long,long>::iterator it1,it2;
				it1=--it;it2=++it;it2++;
				if(it->first - it1->first <= it2->first -it->first)
				printf("%ld %ld\n",a,it1->second);
				else
				printf("%ld %ld\n",a,it2->second);
			}
		}
	}
}

``