Ignatius and the Princess IV
来源:互联网 发布:mac版qq能收发文件吗 编辑:程序博客网 时间:2024/05/22 15:42
Ignatius and the Princess IV
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others)Total Submission(s): 33865 Accepted Submission(s): 14686
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
Author
Ignatius.L
source
这题,因为一定存在个数大于(n+1)/2的数,总数又是奇数个,所以用个快排 输出中间的那个值
#include <iostream>
#include <iostream>
#include <string.h>
#include <algorithm>
#include<cstdio>
int a[9999990];
using namespace std;
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/2]);
}
return 0;
}
#include <iostream>
#include <string.h>
#include <algorithm>
#include<cstdio>
int a[9999990];
using namespace std;
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/2]);
}
return 0;
}
人一我百!人十我万!永不放弃~~~怀着自信的心,去追逐梦想。
阅读全文
0 0
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- Ignatius and the Princess IV
- 无监督对话数据清洗利器:Data Purification Framework
- python学习笔记
- Android 四大组件之ContentProvider
- PHP开源技术大全(二)
- 计算机操作系统——知识点总结
- Ignatius and the Princess IV
- plupload 在IE8和IE9上无法完成附件大小校验
- 常用Oracle分析函数详解
- leetcode--Shortest Word Distance
- 读写 CSV 、pickle文件
- 【C++】返回值是类名和返回值是引用的区别
- String、String()、StringBuffer()、StringBuffer().append()、intern()
- 理解Android Telephony(RIL/AP BP/AT等)电话,短信MMS
- 省市区 三级联动 sql 脚本