B. Running for Gold

题目：https://codeforces.com/contest/1552/problem/B

The Olympic Games have just started and Federico is eager to watch the marathon race.

There will be n athletes, numbered from 1 to n, competing in the marathon, and all of them have taken part in 5 important marathons, numbered from 1 to 5, in the past. For each 1≤i≤n and 1≤j≤5, Federico remembers that athlete i ranked ri,j-th in marathon j (e.g., r2,4=3 means that athlete 2 was third in marathon 4).

Federico considers athlete x superior to athlete y if athlete x ranked better than athlete y in at least 3 past marathons, i.e., rx,j<ry,j for at least 3 distinct values of j.

Federico believes that an athlete is likely to get the gold medal at the Olympics if he is superior to all other athletes.

Find any athlete who is likely to get the gold medal (that is, an athlete who is superior to all other athletes), or determine that there is no such athlete.

Input
The first line contains a single integer t (1≤t≤1000) — the number of test cases. Then t test cases follow.

The first line of each test case contains a single integer n (1≤n≤50000) — the number of athletes.

Then n lines follow, each describing the ranking positions of one athlete.

The i-th of these lines contains the 5 integers ri,1,ri,2,ri,3,ri,4,ri,5 (1≤ri,j≤50000) — the ranking positions of athlete i in the past 5 marathons. It is guaranteed that, in each of the 5 past marathons, the n athletes have distinct ranking positions, i.e., for each 1≤j≤5, the n values r1,j,r2,j,…,rn,j are distinct.

It is guaranteed that the sum of n over all test cases does not exceed 50000.

Output
For each test case, print a single integer — the number of an athlete who is likely to get the gold medal (that is, an athlete who is superior to all other athletes). If there are no such athletes, print −1. If there is more than such one athlete, print any of them.

Example
input
4
1
50000 1 50000 50000 50000
3
10 10 20 30 30
20 20 30 10 10
30 30 10 20 20
3
1 1 1 1 1
2 2 2 2 2
3 3 3 3 3
6
9 5 3 7 1
7 4 1 6 8
5 6 7 3 2
6 7 8 8 6
4 2 2 4 5
8 3 6 9 4
output
1
-1
1
5

题目意思：
有n个运动员，有5项运动，找出冠军，，冠军就是在五项运动中，有任意三项运动比其他运动员要好。

解题思路：
可以把这个求冠军的看成打擂台的，只要有一个人比我厉害那么我就下台，他就在擂台上面守擂台，，，这样一直到最后一个运动员比试完，假设冠军是b，比完之后，肯定之前比试的人会不服气，因为他们中有的人可能有超过三项的成绩比b好，所以为了让其他人心服口服，b就在跟其他所有人打一场，如果赢了说明他就是冠军，遇到一个比他好的那么就停止比试了，说明没有冠军

AC代码：

#include <iostream>
#include <vector>
using namespace std;

const int M = 5;

struct node{
	int r[5];
};

bool operator > (const node a,const node b){
	
	int cnt = 0;
	
	for(int i = 0;i<M;i++) cnt+= a.r[i] > b.r[i];
	
	return cnt >= 3;
}

void solve(){
	
	int n;
	cin >> n;
	
	vector<node> athlete(n);
	
	for(int i = 0;i<n;i++) for(int j = 0;j<M;j++) cin >> athlete[i].r[j];
	
	int gold = 0;
	
	for(int i = 1;i<n;i++){
		if(athlete[gold] > athlete[i]) gold = i;
	}
	
	for(int i = 0;i<n;i++){
		if(i == gold) continue;
		if(athlete[gold] > athlete[i]){
			cout << -1 << endl;
			return;
		}
	}
	cout << gold+1 << endl;
}

int main(){
	
	ios_base::sync_with_stdio(false);
	
	int t;
	cin >> t;
	
	for(int i = 1;i<=t;i++) solve();
	
	return 0;
}