View Code of Problem 63

#include <stdio.h>
#include <string.h>
struct stu
{
	char name[21];
	float height;
	float money;
};
void sort(float *p, int n)
{
	int i, j, min, temp;
	for (i = 0; i < n - 1; i++)
	{
		min = i;
		for (j = i + 1; j < n; j++)
		{
			if (p[j] < p[min])
				min = j;
		}
		temp = p[i];
		p[i] = p[min];
		p[min] = temp;
	}
}
float find(float *p, int n, float x)
{
	int i;
	for (i = 0; i < n; i++)
	{
		if (p[i] == x)
			return i;
	}
}
int main()
{
	int n, i, s1, s2;
	float a[1000], b[1000], x, y;
	struct stu s[1000];
	scanf("%d", &n);
	for (i = 0; i < n; i++)
	{
		scanf("%s%f%f", s[i].name, &s[i].height, &s[i].money);
		a[i] = s[i].height;
		b[i] = s[i].money;
		if (strcmp(s[i].name, "Suxiao") == 0)
		{
			x= s[i].height;
			y= s[i].money;
		}
	}
	sort(a, n);
	sort(b, n);
	s1 = find(a, n, x);
	s2 = find(b, n, y);
	if (s1 == s2)
		printf("EQ\n");
	else if (s1 > s2)
		printf("HEIGHT\n");
	else
		printf("MONEY\n");
	return 0;
}