sdut1696

http://blog.csdn.net/dreamzuora/article/details/53054410

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;
struct st
{
	char name[100];
	int h,w;
};
int cmp(st a,st b)
{
	if(a.h!=b.h)
	return a.h<b.h;
	else
	return a.w<b.w;
}
int main()
{
	int t;
	st a[1000];
	cin>>t;
	for(int i=0;i<t;i++)
	cin>>a[i].name>>a[i].h>>a[i].w;
	sort(a,a+t,cmp);
	int ave1H,ave2H,ave1W,ave2W;
	cin>>ave1H>>ave2H>>ave1W>>ave2W;
	int ok=0;
	for(int i=0;i<t;i++)
	{
		if(a[i].h>=ave1H&&a[i].w>=ave1W&&a[i].h<=ave2H&&a[i].w<=ave2W)
		{
			ok=1;
			cout<<a[i].name<<" "<<a[i].h<<" "<<a[i].w<<endl;
			}	
		}
		if(!ok)
		cout<<"No"<<endl;	
	return 0;
}