HDU 1029 Ignatius and the Princess IV
来源:互联网 发布:内存频率测试软件 编辑:程序博客网 时间:2024/05/07 19:20
Problem Description
"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?
"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?
Input
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.
Output
For each test case, you have to output only one line which contains the special number you have found.
Sample Input
51 3 2 3 3111 1 1 1 1 5 5 5 5 5 571 1 1 1 1 1 1
Sample Output
351直接排序,(n+1)/2-1一定是该值的下标#include<stdio.h>#include<iostream>#include<algorithm>using namespace std;int a[1000000];int main(){int m,n,i,j,max,p,t,k;while(~scanf("%d",&n)){for(i=0;i<n;i++)scanf("%d",&a[i]);sort(a,a+n);printf("%d\n",a[(n+1)/2-1]);}return 0;}
0 0
- hdu 1029 Ignatius and the Princess IV
- HDU 1029 Ignatius and the Princess IV
- HDU 1029 Ignatius and the Princess IV
- HDU 1029 Ignatius and the Princess IV
- hdu 1029 Ignatius and the Princess IV
- hdu 1029 Ignatius and the Princess IV
- hdu 1029 Ignatius and the Princess IV
- hdu 1029 Ignatius and the Princess IV
- Ignatius and the Princess IV hdu 1029
- hdu 1029 Ignatius and the Princess IV
- HDU 1029 Ignatius and the Princess IV
- HDU 1029 Ignatius and the Princess IV
- hdu 1029 Ignatius and the Princess IV
- hdu 1029 Ignatius and the Princess IV
- HDU 1029 Ignatius and the Princess IV
- HDU-1029-Ignatius and the Princess IV
- HDU--1029--Ignatius and the Princess IV
- hdu - 1029 -Ignatius and the Princess IV
- 第5周作业-字体设置
- HDU 1032 The 3n + 1 problem
- hdu1097 A hard puzzle
- 磁盘管理类命令
- POJ3928 Ping pong 树状数组
- HDU 1029 Ignatius and the Princess IV
- Android 事件分发机制
- 查找类命令
- FirstDayofMemoryTraining
- 进程管理类命令
- vector中的成员函数
- nutch-1.7-学习笔记(1)-org.apache.nutch.crawl-ToolRunner
- 解疑初学java比较迷惑的地方
- 税