Median

128人阅读 评论(0)

题目描述：
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<stdio.h>
#define max 1000000
long arry[max];
int main()
{
<span style="white-space:pre">	</span>
<span style="white-space:pre">	</span>int N, M;
<span style="white-space:pre">	</span>scanf("%d" , &N);

<span style="white-space:pre">	</span>for (int i = 0; i < N; i++)
<span style="white-space:pre">	</span>{
<span style="white-space:pre">		</span>scanf("%ld" , &arry[i]);
<span style="white-space:pre">	</span>}

<span style="white-space:pre">	</span>scanf("%d", &M);

<span style="white-space:pre">	</span>for (int j = N; j < N+M; j++)
<span style="white-space:pre">	</span>{
<span style="white-space:pre">		</span>scanf("%ld", &arry[j]);
<span style="white-space:pre">	</span>}

<span style="white-space:pre">	</span>for (int i = 0; i < N + M; i++)
<span style="white-space:pre">	</span>{
<span style="white-space:pre">		</span>for (int j = i + 1; j < N + M; j++)
<span style="white-space:pre">		</span>{
<span style="white-space:pre">			</span>if (arry[i] > arry[j])
<span style="white-space:pre">			</span>{
<span style="white-space:pre">				</span>arry[i] = arry[i] ^ arry[j];
<span style="white-space:pre">				</span>arry[j] = arry[i] ^ arry[j];
<span style="white-space:pre">				</span>arry[i] = arry[i] ^ arry[j];
<span style="white-space:pre">			</span>}
<span style="white-space:pre">		</span>}
<span style="white-space:pre">	</span>}
<span style="white-space:pre">	</span>
<span style="white-space:pre">	</span>if ((M + N) % 2 != 0)
<span style="white-space:pre">	</span>{
<span style="white-space:pre">		</span>printf("%ld\n" , arry[(M + N)/2]);
<span style="white-space:pre">	</span>}
<span style="white-space:pre">	</span>else
<span style="white-space:pre">	</span>{
<span style="white-space:pre">		</span>printf("%ld\n", (arry[(M + N) / 2]+arry[(M + N + 2) / 2]) / 2);
<span style="white-space:pre">	</span>}
<span style="white-space:pre">	</span>
<span style="white-space:pre">	</span>getchar();
<span style="white-space:pre">	</span>getchar();
<span style="white-space:pre">	</span>return 0;
}

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：16009次
• 积分：831
• 等级：
• 排名：千里之外
• 原创：67篇
• 转载：0篇
• 译文：0篇
• 评论：3条
文章分类
评论排行
最新评论