Codeforces 570A Elections

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;
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值