PAT甲级1029 Median-CSDN博客

本文链接：https://blog.csdn.net/weixin_43318827/article/details/109516348

本文介绍了一种简单的方法来找到两个已排序整数序列的中位数。通过合并两个序列并排序，然后找到合并后序列的中间元素，即可得到所求中位数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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×10⁵ ) 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 <iostream>
#include <cstdlib>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
	vector<int> vec;
	for (int i = 0; i < 2; i++)
	{
		int n;
		cin >> n;
		for (int i = 0; i < n; i++)
		{
			int num;
			cin >> num;
			vec.push_back(num);
		}
	}
	sort(vec.begin(), vec.end());
	int size = vec.size();
	int mid_index;
	if (size & 1)
		mid_index = size / 2;
	else
		mid_index = (size - 1) / 2;
	cout << vec[mid_index] << endl;
	system("pause");
	return 0;
}