HDU 1029 Ignatius and the Princess IV(排序取数)
2016-04-17 01:15
337 查看
Ignatius and the Princess IV
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others)Total Submission(s): 25416 Accepted Submission(s): 10716
[align=left]Problem Description[/align]
"OK, you are not too bad, em... But you can never pass the next test." feng5166 says.
"I will tell you an odd number N, and then N integers. There will be a special integer among them, you have to tell me which integer is the special one after I tell you all the integers." feng5166 says.
"But what is the characteristic of the special integer?" Ignatius asks.
"The integer will appear at least (N+1)/2 times. If you can't find the right integer, I will kill the Princess, and you will be my dinner, too. Hahahaha....." feng5166 says.
Can you find the special integer for Ignatius?
[align=left]Input[/align]
The input contains several test cases. Each test case contains two lines. The first line consists of an odd integer N(1<=N<=999999) which indicate the number of the integers feng5166 will tell our hero.
The second line contains the N integers. The input is terminated by the end of file.
[align=left]Output[/align]
For each test case, you have to output only one line which contains the special number you have found.
[align=left]Sample Input[/align]
5 1 3 2 3 3 11 1 1 1 1 1 5 5 5 5 5 5 7 1 1 1 1 1 1 1
[align=left]Sample Output[/align]
3 5 1
[align=left]题解:[/align]
[align=left]求出出现次数为n+1/2的数。。。。sort大法。。。[/align]
[align=left]AC代码:[/align]
#include<cstdio> #include<algorithm> using namespace std; int a[999999]; int main() { int n; while(~scanf("%d",&n)) { for(int i=0;i<n;i++) { scanf("%d",&a[i]); } sort(a,a+n); printf("%d\n",a[(n+1)/2]); } return 0; }
相关文章推荐
- 设计模式之代理模式
- JQuery学习之旅之显示和影藏
- Python的排列组合运用
- forward的第二种使用方式
- 搭建邮件服务器时设置A/MX记录方法详解
- eclipse字符集编码设置
- 【python小练】图片爬虫之BeautifulSoup4
- laravel中间件-----------middleware
- excel工作薄密码破解/清除
- CentOS7.2系统环境中安装saltstack详细配置过程讲解
- 是什么遮蔽了时寒冰的眼睛
- Code::Blocks配置MSVC2013编译器
- 模拟器常用快捷键
- Python中自定义模块的引用
- 226.[LeetCode]Invert Binary Tree
- Context概述
- Iocomp控件教程之Analog Display—模拟显示控件(优于EDIT控件)
- 如何理解函数形参为指针和引用类型的参数传递
- XP下,文件夹添加右键命令行
- UML类图简单介绍