1029 Median (25分)
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:
13
题意很简单,就是找中位数
本来以为是个青铜,没想到是个王者……
用队列超时,改用vector+sort 再加上输入输出优化……刚刚卡过
不过这道题还有其他办法,具体可参考柳神blog
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int n1, n2;
ll a;
//priority_queue<ll> q;
vector<ll> vec;
int main(){
ios::sync_with_stdio(false);
cin >> n1;
for(int i = 0; i < n1; i++){
cin >> a;
// q.push(a);
vec.push_back(a);
}
cin >> n2;
for(int i = 0; i < n2; i++){
cin >> a;
// q.push(a);
vec.push_back(a);
}
sort(vec.begin(), vec.end());
int mid = (n1 + n2 - 1) / 2;
vector<ll> ::iterator it;
it = vec.begin() + mid;
cout <<(*it) << endl;
// int ind = 0;
// while(!q.empty()){
//
// ind ++;
// if(ind == mid){
// cout << q.top() << endl;
// break;
// }
// q.pop();
// }
return 0;
}