codeforces 570A

codeforces 570A

A. Elections
memory limit per test256
megabytes
inputstandard input

The country of Byalechinsk is running elections involving n candidates. The country
consists of m cities. We know how many people in each city voted for
each candidate.

The electoral system in the country is pretty unusual. At the first
stage of elections the votes are counted for each city: it is assumed
that in each city won the candidate who got the highest number of
votes in this city, and if several candidates got the maximum number
of votes, then the winner is the one with a smaller index.

At the second stage of elections the winner is determined by the same
principle over the cities: the winner of the elections is the
candidate who won in the maximum number of cities, and among those who
got the maximum number of cities the winner is the one with a smaller
index.

Determine who will win the elections.

Input The first line of the input contains two integers n, m
(1 ≤ n, m ≤ 100) — the number of candidates and of cities,
respectively.

Each of the next m lines contains n non-negative integers, the j-th
number in the i-th line aij (1 ≤ j ≤ n, 1 ≤ i ≤ m, 0 ≤ aij ≤ 109)
denotes the number of votes for candidate j in city i.

It is guaranteed that the total number of people in all the cities
does not exceed 109.

Output Print a single number — the index of the candidate who won the
elections. The candidates are indexed starting from one.

Sample test(s) input 3 3 1 2 3 2 3 1 1 2 1 output 2 input 3 4 10 10 3
5 1 6 2 2 2 1 5 7 output 1 Note Note to the first sample test. At the
first stage city 1 chosen candidate 3, city 2 chosen candidate 2, city
3 chosen candidate 2. The winner is candidate 2, he gained 2 votes.

Note to the second sample test. At the first stage in city 1
candidates 1 and 2 got the same maximum number of votes, but candidate
1 has a smaller index, so the city chose candidate 1. City 2 chosen
candidate 3. City 3 chosen candidate 1, due to the fact that everyone
has the same number of votes, and 1 has the smallest index. City 4
chosen the candidate 3. On the second stage the same number of cities
chose candidates 1 and 3. The winner is candidate 1, the one with the
smaller index.

题意

例子中第一行表示竞选人数n和城市总数m。
接下来又M行分别表示M个城市，
每行有N列 表示每个人的选票，
在同一个城市中得票最高的获得一分，
如有同票顺序靠前的获得1分，
最后总分最高的成为市长。
如果有同分的顺序靠前的获胜。

分析

只需要将每一个数据读入数组A
再判断大小
用数组B记录下每人的得分（B[0] 空出不用）
（注意 条件是 A[i] > max不用>=）可以符合取第一个最大的原则
最后判断B数组的最大数 依旧用上面的条件

具体实践

读入n , m.
在第一个城市
：：读入数据 判断最大
：：将最大的对应的人在数组B中+1
遍历所有的城市
在数组B中找出最大的并输出他的序号

代码不贴