【PAT (Advanced Level) Practice】1029 Median (25 分)题解【nth_element法】

xu_haiao

已于 2022-04-08 21:18:03 修改

阅读量445

点赞数 1

分类专栏： PAT (Advanced Level) Practice 文章标签： c++

于 2022-04-08 21:16:21 首次发布

本文链接：https://blog.csdn.net/xu_haiao/article/details/124051096

版权

PAT (Advanced Level) Practice 专栏收录该内容

11 篇文章

订阅专栏

该博客介绍了一种使用STL中的nth_element函数来寻找两个递增序列中位数的方法。程序首先读入两个递增序列，然后通过nth_element找出序列的中位数，当序列元素总数为偶数时取中间较小的数，为奇数时取中间的数。整个过程的时间复杂度为O(n)。

摘要由CSDN通过智能技术生成

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 nondecreasing 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.

Input Specification:

Each input file contains one test case. Each case occupies 2 lines, each gives the information of a sequence. For each sequence, the first positive integer N (≤2×105) 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.

Output Specification:

For each test case you should output the median of the two given sequences in a line.

Sample Input:

4 11 12 13 14
5 9 10 15 16 17

Sample Output:

#include <bits/stdc++.h>
using namespace std;
long long A[10000000];
int main() {
	long long a, b, temp1, temp2;
	cin >> a;
	for (long long i = 0; i < a; i++) {
		cin >> A[i];
	}
	cin >> b;
	for (long long i = a; i < a+b+1; i++) {
		cin >> A[i];
	}
    if ((a+b)%2 == 0){ //如果元素个数为偶数则取第(a+b)/2-1个数为中位数
        nth_element(A, A + (a+b) / 2-1, A + a+b);
        cout << A[(a+b)/2-1];
    }
    else{ //如果元素个数为奇数则取第(a+b)/2个数为中位数
        nth_element(A, A + (a+b) / 2, A + a+b);
        cout << A[(a+b)/2];
    }
	return 0;
}