程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> C++入門知識 >> 題目1004:Median

題目1004:Median

編輯:C++入門知識

題目1004:Median


題目描述:

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


#include

int main()
{
int M,N;
while(scanf("%d",&M)!=EOF)
{
long MArray[M];
for(int i=0;i scanf("%ld",&MArray[i]);
scanf("%d",&N);
long NArray[N];
for(int j=0;j scanf("%ld",&NArray[j]);
long bothArray[M+N];
int p1=0,p2=0;
for(int i = 0;i {

if(MArray[p1] {
bothArray[i] = MArray[p1];
p1++;
}
else if(MArray[p1]>NArray[p2])
{
bothArray[i]= NArray[p2];
p2++;
}
else
{
bothArray[i]= MArray[p1];
p1++;
p2++;
}
}
long increaseSeq[M+N];
int end=M+N-1;
int p3=0;
for(int i=0;i {
if(bothArray[i]!=bothArray[i+1])
{

increaseSeq[p3]=bothArray[i];
p3++;
}
if(bothArray[i]==bothArray[i+1])
end--;
}
printf("%ld\n",increaseSeq[end/2]);
}
}


  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved