九度 OJ 1004:Median
2016-05-22 16:15
369 查看
题目1004:Median
时间限制:1 秒
内存限制:32 兆
特殊判题:否
提交:17340
解决:4807
题目描述:
Given an increasing sequence S of N integers, the median is the number at the middle position. For example, the median of S1={11, 12, 13, 14} is 12, and the median of S2={9, 10, 15, 16, 17} is 15. The median of two sequences
is defined to be the median of the non-decreasing sequence which contains all the elements of both sequences. For example, the median of S1 and S2 is 13.
Given two increasing sequences of integers, you are asked to find their median.
输入:
Each input file may contain more than one test case.
Each case occupies 2 lines, each gives the information of a sequence. For each sequence, the first positive integer N (≤1000000) is the size of that sequence. Then N integers follow, separated by a space.
It is guaranteed that all the integers are in the range of long int.
输出:
For each test case you should output the median of the two given sequences in a line.
样例输入:
样例输出:
来源:
2011年浙江大学计算机及软件工程研究生机试真题
这题最简单的应该就是直接sort了,之前变量类型用的long int ,题中要求的是long int ,但是超时,结果改成int 还过了,不知道怎么搞得,这个变量类型一直不清不白的
#include <iostream>
#include <cmath>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define N 2000000
int P
;
int main()
{
int m,n;
while(scanf("%d",&m)!=EOF){
for(int i=0;i<m;i++){
scanf("%d",&P[i]);
}
scanf("%d",&n);
for(int i=m;i<n+m;i++){
scanf("%d",&P[i]);
}
sort(P,P+m+n);
printf("%d\n",P[(m+n+1)/2-1]);
}
}
/**************************************************************
Problem: 1004
User: th是个小屁孩
Language: C++
Result: Accepted
Time:0 ms
Memory:9332 kb
****************************************************************/
时间限制:1 秒
内存限制:32 兆
特殊判题:否
提交:17340
解决:4807
题目描述:
Given an increasing sequence S of N integers, the median is the number at the middle position. For example, the median of S1={11, 12, 13, 14} is 12, and the median of S2={9, 10, 15, 16, 17} is 15. The median of two sequences
is defined to be the median of the non-decreasing sequence which contains all the elements of both sequences. For example, the median of S1 and S2 is 13.
Given two increasing sequences of integers, you are asked to find their median.
输入:
Each input file may contain more than one test case.
Each case occupies 2 lines, each gives the information of a sequence. For each sequence, the first positive integer N (≤1000000) is the size of that sequence. Then N integers follow, separated by a space.
It is guaranteed that all the integers are in the range of long int.
输出:
For each test case you should output the median of the two given sequences in a line.
样例输入:
4 11 12 13 14 5 9 10 15 16 17
样例输出:
13
来源:
2011年浙江大学计算机及软件工程研究生机试真题
这题最简单的应该就是直接sort了,之前变量类型用的long int ,题中要求的是long int ,但是超时,结果改成int 还过了,不知道怎么搞得,这个变量类型一直不清不白的
#include <iostream>
#include <cmath>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define N 2000000
int P
;
int main()
{
int m,n;
while(scanf("%d",&m)!=EOF){
for(int i=0;i<m;i++){
scanf("%d",&P[i]);
}
scanf("%d",&n);
for(int i=m;i<n+m;i++){
scanf("%d",&P[i]);
}
sort(P,P+m+n);
printf("%d\n",P[(m+n+1)/2-1]);
}
}
/**************************************************************
Problem: 1004
User: th是个小屁孩
Language: C++
Result: Accepted
Time:0 ms
Memory:9332 kb
****************************************************************/
相关文章推荐
- 九度1526
- 九度1025:最大报销额 java
- 九度 题目1026:又一版 A+B java
- 【九度】题目1006:ZOJ问题
- 【九度】题目1005:Graduate Admission
- 【九度】题目1004:Median
- 【九度】题目1003:A+B
- 【九度】题目1002:Grading
- 【九度】题目1001:A+B for Matrices
- 【九度】题目1000:计算a+b
- 三、Hash练习_1156_1
- 三、Hash_1081_1
- 给定两个整数A和B,其表示形式是:从个位开始,每三位数用逗号","隔开。
- 并查集
- JOBDU Q1001
- JOBDU Q1002
- JOBDU Q1003
- JOBDU Q1004
- 九度题目1431解
- 九度--第1001题:A+B for Matrices