2019 icpc南昌 L - Who is the Champion 计蒜客 - 42587

题目链接：https://nanti.jisuanke.com/t/42587

#pragma warning (disable:4996)
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <cstring>
#include <string>
#include <cstdio>
#include <cmath>
#include <vector>
#include <queue>
#define inf 0X3f3f3f3f
using namespace std;
typedef long long ll;
typedef unsigned long long ull;

const int mod = 1e9 + 7;
const int SIZE = 1e5 + 20;

int a[150][150];

struct node {
	int pos;
	int sco;
	int go;
} nodes[150];

bool cmp(const node x, const node y) {
	if (x.sco == y.sco)
		return x.go > y.go;
	return x.sco > y.sco;
}

int main() {
	int n;
	while (~scanf("%d", &n)) {
		for (int i = 1; i <= n; i++) {
			nodes[i].pos = i;
			nodes[i].sco = 0;
			nodes[i].go = 0;
		}
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= n; j++) {
				scanf("%d", &a[i][j]);
			}
		}
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= n; j++) {
				if (i == j)
					continue;
				nodes[i].go += a[i][j];
				if (a[i][j] > a[j][i]) {
					nodes[i].sco += 3;
				}
				else if (a[i][j] == a[j][i]) {
					nodes[i].sco += 1;
				}
			}
		for (int j = 1; j <= n; j++) {
			for (int i = 1; i <= n; i++) {
				if (i == j)
					continue;
				nodes[j].go -= a[i][j];
			}
		}
		sort(nodes + 1, nodes + n + 1, cmp);
		if (n == 1)
			printf("1\n");
		else if (nodes[1].go == nodes[2].go)
			printf("play-offs\n");
		else
			printf("%d\n", nodes[1].pos);
	}
	return 0;
}