思路:先找出每个城市里票数最多的人的下标(小函数),在输入时可得到每一行的最大数下标,并将其放入一个新的list之中(every-line-max)。接着就需要用到dictionary了,判断每个下标出现的次数(key),接着再循环次数(key),找出所对应的value等于max-num的最靠前的key。(记得输出时要+1)
http://codeforces.com/contest/570/problem/A
def get_the_index(line):
max_index = 0
for i in range(1,len(line)):
if line[i] > line[max_index]:
max_index = i
return max_index
n,m = map(int,raw_input().split())
every_line_max = []
for i in range(m):
line = map(int,raw_input().split())
line_max = get_the_index(line)
every_line_max.append(line_max)
d = {}
max_num = 0
result= 0
for i in range(m):
if every_line_max[i] in d:
d[every_line_max[i]] += 1
if d[every_line_max[i]] > max_num:
max_num = d[every_line_max[i]]
else:
d[every_line_max[i]] = 1
min_key = 10**9
for key in d.keys():
if d[key] == max_num:
if key < min_key:
min_key = key
print min_key+1