VK Cup 2016 - Qualification Round 1——A. Voting for Photos(queue+map)
1 second
256 megabytes
standard input
standard output
After celebrating the midcourse the students of one of the faculties of the Berland State University decided to conduct a vote for the best photo. They published the photos in the social network and agreed on the rules to choose a winner: the photo which gets most likes wins. If multiple photoes get most likes, the winner is the photo that gets this number first.
Help guys determine the winner photo by the records of likes.
The first line of the input contains a single integer n (1 ≤ n ≤ 1000) — the total likes to the published photoes.
The second line contains n positive integers a1, a2, ..., an (1 ≤ ai ≤ 1 000 000), where ai is the identifier of the photo which got the i-th like.
Print the identifier of the photo which won the elections.
5
1 3 2 2 1
2
9
100 200 300 200 100 300 300 100 200
300
In the first test sample the photo with id 1 got two likes (first and fifth), photo with id 2 got two likes (third and fourth), and photo with id 3got one like (second).
Thus, the winner is the photo with identifier 2, as it got:
- more likes than the photo with id 3;
- as many likes as the photo with id 1, but the photo with the identifier 2 got its second like earlier.
这俩题是STL专场的节奏吗- -|||。题意:按照顺序进行投票,若多人票数相同先获得最高票数的那个胜出。map记录人名+票数,queue记录先后顺序
代码:
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<cstring>
#include<cmath>
#include<stack>
#include<queue>
using namespace std;
typedef pair<int,int> pii;
int main(void)
{
int n,num;
while (~scanf("%d",&n))
{
queue<pii>qlist;
map<int,int>mlist;
scanf("%d",&num);
mlist[num]++;//先把头一个放进去填充一下
qlist.push(pii(num,mlist[num]));
for (int i=1; i<n; i++)
{
scanf("%d",&num);
mlist[num]++;
if(mlist[num]>((qlist.back()).second))
qlist.push(pii(num,mlist[num]));
}
cout<<(qlist.back()).first<<endl;
}
return 0;
}
最新文章
- 关于React的父子组件通信等等
- CSS 概念 &; 作用
- UIImage加载本地图片的两种方式
- X86 Socket 通信
- 【JavaScript】常用方法
- jade模板引擎学习笔记(WebsStorm9.0.3+ nodejs+express+jade)
- 数据库中is null(is not null)与=null(!=null)的区别
- Java之有病的policy配置
- input 表单点击消失离开出现
- wildfly部署solr.war
- Android Studido下的应用性能优化总结--布局优化
- HDU1150 Machine Schedule(二分图最大匹配、最小点覆盖)
- 指尖上的电商---(4).net开发solr
- 1--HTTP基础知识
- 生信分析常用脚本(二)--SOAPdenovo
- mysql--user表
- Convert Binary Search Tree to Doubly Linked List
- freeRTOS中文实用教程3--中断管理之中断服务例程中使用队列
- Linux系统默默改变了人类世界的生活方式
- <;mvn:default-servlet-handler/>;标签作用
热门文章
- 日常-acm-开灯问题
- php 基本连接mysql数据库和查询数据
- codeforce Gym 100685F Flood (topo排序)
- 棋盘问题——POJ1321
- tcp、http和socket的区别
- stixel-world跑在kitti数据集
- Hicharts图表的使用
- 学习笔记(四): Representation:Feature Engineering/Qualities of Good Features/Cleaning Data/Feature Sets
- $GLOBALS[&#39;HTTP_RAW_POST_DATA&#39;]与$_POST的区别
- 如何用纯 CSS 创作一个小球反弹的动画