设置排序规则对自定义的结构体进行

typedef struct
{
	int tall;
	char name[15];
}student;

bool cmp(student A, student B)
{
	if (strcmp(A.name, B.name) > 0)
		return true;
	if (!strcmp(A.name, B.name) && A.tall > B.tall)
		return true;
	return false;
}

#include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;


typedef struct
{
	int MakeMilk;
	int num;
}COW;

COW cow[100];
bool cmp(COW A, COW B)
{
	if (A.MakeMilk < B.MakeMilk)
		return true;
	if (A.MakeMilk == B.MakeMilk&&A.num > B.num)
		return true;
	return false;
}


int main()
{
	int n;
	while (scanf_s("%d", &n) != EOF)
	{
		for (int i = 1; i <= n; i++)
		{
			scanf_s("%d", &cow[i].MakeMilk);
			cow[i].num = i;
		}
		sort(cow + 1, cow + 1 + n, cmp);
		printf("%d\n", cow[(n + 1) / 2].MakeMilk);
	}
    return 0;
}

#include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;



int main()
{
	int dat[20];
	char str[10];
	int n, k, m;
	scanf_s("%d", &n);
	for (int i = 0; i < n; i++)
		scanf_s("%d", &dat[i]);
	scanf_s("%s", str, 10);
	sort(dat, dat + n);
	scanf_s("%d", &k);
	for (int i = 0; i < k; i++)
	{
		scanf_s("%d", &m);
		printf("%d\n", dat[m-1]);
	}
    return 0;
}