View Code of Problem 63

#include<iostream>
#include<math.h>
#include<algorithm>
#include<string>
using namespace std;
struct node{
	string n;
	int h;
	int m;
}s[1001];

bool cmp1(node x,node y){
	return x.h>y.h;
}

bool cmp2(node x,node y){
	return x.m>y.m;
} 
int main(){
	int k,a=0,b=0;
	cin>>k;
	for(int i=0;i<k;i++){
		cin>>s[i].n>>s[i].h>>s[i].m;
	}
	sort(s,s+k,cmp1);
	for(int i=0;i<k;i++){
//		cout<<s[i].n<<" "<<s[i].h<<" "<<s[i].m<<endl;
		if(s[i].n=="Suxiao"){
			a=i;
//			cout<<a<<endl;
			break;	
		}
		
	}
//	cout<<endl;
	sort(s,s+k,cmp2);
	for(int i=0;i<k;i++){
//		cout<<s[i].n<<" "<<s[i].h<<" "<<s[i].m<<endl;
		if(s[i].n=="Suxiao"){
			b=i;
//			cout<<b<<endl;
			break;
		}
	} 
	if(a<b)cout<<"HEIGHT"<<endl;
	else if(a==b)cout<<"EQ"<<endl;
	else if(a>b)cout<<"Money"<<endl;
	return 0;
}