View Code of Problem 63

#include <bits/stdc++.h>
using namespace std;
typedef struct {
	string name;
	int height;
	int money ;
}Stu;

int cmp1(Stu sa,Stu sb) {
	if(sa.height!=sb.height) return sa.height>sb.height;
	return sa.money>sb.money;
}

int cmp2(Stu sa,Stu sb) {
	if(sa.money!=sb.money) return sa.money>sb.money;
	return sa.height>sb.height;
	
}

int main()
{
	int n;
	while(cin>>n) {
		Stu stu[n];
		int yh,ym;
		for(int i=0;i<n;i++) {
			cin>>stu[i].name>>stu[i].height>>stu[i].money;
		}
		//height sort
		sort(stu,stu+n,cmp1);
		for(int i=0;i<n;i++) {
			if(stu[i].name=="Suxiao") {
				yh = i+1;
				break;
			}
		}
		//money sort
		sort(stu,stu+n,cmp2);
		for(int i=0;i<n;i++) {
			if(stu[i].name=="Suxiao") {
				ym = i+1;
				break;
			}
		}
		
		if(yh<ym) cout<<"HEIGHT"<<endl;
		else if(yh>ym) cout<<"MONEY"<<endl;
		else cout<<"EQ"<<endl;
	}
	
	return 0;
 }