当前位置: 代码迷 >> 综合 >> PAT甲级-1029 Median (25分)
  详细解决方案

PAT甲级-1029 Median (25分)

热度:49   发布时间:2023-09-26 23:43:48.0

点击链接PAT甲级-AC全解汇总

题目:
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?5?? ) 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:

13

题意:
输入两行数,输出中间位置的数,不是中位数!
中位数的话,偶数个数还需要找中间两个数求平均,这题都不需要

所以直接投机取巧了

我的代码:

#include<bits/stdc++.h>
using namespace std;int main()
{
    vector<long long>num;int N;cin>>N;for(int i=0;i<N;i++){
    int t;cin>>t;num.push_back(t);}cin>>N;for(int i=0;i<N;i++){
    int t;cin>>t;num.push_back(t);}sort(num.begin(),num.end());cout<<num[(num.size()-1)/2]<<endl;return 0;
}