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<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;
}
阅读更多
个人分类: 实验室ACM
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

Median

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭