选夫婿

#include<stdio.h>
#include<algorithm>
using namespace std;
struct E
{
char name [40];
int high;
int weight;
}s[1000];
int cmp(E q,E w)
{
if(q.high==w.high)
return q.weight<w.weight;
else return q.high<w.high;
}
int main()
{
int n,i,a,b,c,d,m=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d%d",&s[i].name,&s[i].high,&s[i].weight);
}
scanf("%d%d%d%d",&a,&b,&c,&d);
sort(s,s+n,cmp);
for(i=0;i<n;i++)
if(s[i].high>=a&&s[i].high<=b&&s[i].weight>=c&&s[i].weight<=d)
{
printf("%s %d %d\n",s[i].name,s[i].high,s[i].weight);
m++;
}
if(m==0)printf("No\n");

return 0;
}