Codeforces 570A__Elections
2015-08-18 15:41
429 查看
A. Elections
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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
output
input
output
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代表城市,第一阶段在每个城市举行,选出票数最高的,如果票数相等则选出下标最小的。第二阶段选出城市数最高的候选人,如果相等则取下标最小的
代码如下:
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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代表城市,第一阶段在每个城市举行,选出票数最高的,如果票数相等则选出下标最小的。第二阶段选出城市数最高的候选人,如果相等则取下标最小的
代码如下:
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<cmath> using namespace std; int main() { int n,m,MAX,vis[110],count[110],ch[110]; while(~scanf("%d%d",&n,&m)) { memset(vis,0,sizeof(vis)); memset(count,0,sizeof(count)); int k=0,a,ans; for(int i=1;i<=m;i++) { MAX=-1; for(int j=1;j<=n;j++) { //找到这个城市里最大的票数的候选者 scanf("%d",&a); if(a>MAX) { MAX=a; ans=j; } } if(!vis[ans]) { ch[k++]=ans; vis[ans]=1; count[ans]=1; } else count[ans]++; } sort(ch,ch+k); MAX=0; for(int i=0;i<k;i++) { if(count[ch[i]]>MAX) { MAX=count[ch[i]]; ans=ch[i]; } } printf("%d\n",ans); } return 0; }
相关文章推荐
- 树结构练习——判断给定森林中有多少棵树
- 位操作总结
- javascript知识回顾
- 厦门大学线下编程比赛第一题:求和
- Android JIN返回结构体
- 编程作业—C++初探 简单的学生信息处理程序实现
- DateUtil
- UVA 11600-Masud Rana(状压,概率dp)
- dell 720 raid 配置
- 浅析信息系统架构的应用架构与数据架构
- Hibernate映射关系配置
- poj2240 Bellman-ford最短路求最大回路
- smarty用法汇总
- iOS经典网络开源库(整理)
- MSHFlexgrid和MSflexgrid控件异同
- 事业是“横”的,挣钱是“竖”的
- Android Development Note-02
- 大小端模式转换函数
- javascript 基础2第12节
- 黑马程序员_String类型以及StringBuilder