View Code of Problem 63

#include<iostream>
#include<algorithm>
using namespace std;
struct Stu{
	string name;
	int  hg;
	int Mo;
};
bool cmp1(Stu lhs,Stu rhs){
	return lhs.hg>rhs.hg ;
}
bool cmp2(Stu lhs,Stu rhs){
	return lhs.Mo>rhs.Mo ;
}
int main(){
	int N;
	cin>>N;
		int pos1=0,pos2=0;
		Stu ar1[N];
		Stu ar2[N];
		for(int i=0;i<N;i++){
			cin>>ar1[i].name>>ar1[i].hg>>ar1[i].Mo;
			ar2[i].name=ar1[i].name;ar2[i].hg=ar1[i].hg;ar2[i].Mo=ar1[i].Mo;
		}
		sort(ar1,ar1+N,cmp1);
		sort(ar2,ar2+N,cmp2);
		for(int i=0;i<N;i++){
			if(ar1[i].name=="Suxiao"){
				pos1=i;
			}
			if(ar2[i].name=="Suxiao"){
				pos2=i;
			}
		}
		//cout<<pos1<<" "<<pos2<<endl;
		if(pos1==pos2){
			cout<<"EQ"<<endl;
		}
		else if(pos1<pos2){
			cout<<"HEIGHT"<<endl;
		}
		else{
			cout<<"MONEY"<<endl;
		}
}