3254021_wa.cpp

北大大牛代码 1240道题的原代码 超级权威

#include <stdio.h>
#include <string.h>
#include <algorithm>

struct point
{
	int x, y;
	int id;
};

bool cmp1(point a,point b)
{
	if(a.x == b.x)
		return a.y < b.y;
	else
		return a.x < b.x;
}

bool cmp2(point a,point b)
{
	if(a.x == b.x)
		return a.y > b.y;
	else
		return a.x < b.x;
}

point apple[100], ant[100];
int n;

int main()
{
	int i;
	int ans[100];

	scanf("%d",&n);
	for(i = 0; i < n; i++)
	{
		ant[i].id = i;
		scanf("%d%d",&ant[i].x,&ant[i].y);
	}
	for(i = 0; i < n; i++)
	{
		apple[i].id = i;
		scanf("%d%d",&apple[i].x,&apple[i].y);
	}
	std::sort(ant,ant+n,cmp1);
	std::sort(apple,apple+n,cmp2);
	for(i = 0; i < n; i++)
	{
		ans[ant[i].id] = apple[i].id;
	}
	for(i = 0; i < n; i++)
	{
		printf("%d\n",ans[i]+1);
	}
	return 0;
}