Elections
题目链接:
http://codeforces.com/problemset/problem/570/A
解题思路:
We need to determine choice for each city. Then sum it for each candidate and determine the winner.
O(n * m)
AC代码:
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int num[110];
int main(){
int n,m;
while(~scanf("%d%d",&n,&m)){
memset(num,0,sizeof(num));
int sum,tmp,x;
for(int i = 1; i <= m; i++){
sum = 0;tmp = 1;
for(int j = 1; j <= n; j++){
scanf("%d",&x);
if(sum < x){
tmp = j;
sum = x;
}
}
num[tmp]++;
}
sum = 0;tmp = 1;
for(int i = 1; i <= n; i++){
if(sum < num[i]){
sum = num[i];
tmp = i;
}
}
printf("%d\n",tmp);
}
return 0;
}