国产探花免费观看_亚洲丰满少妇自慰呻吟_97日韩有码在线_资源在线日韩欧美_一区二区精品毛片,辰东完美世界有声小说,欢乐颂第一季,yy玄幻小说排行榜完本

首頁 > 學院 > 開發設計 > 正文

1029. Median (25)

2019-11-11 07:42:50
字體:
來源:轉載
供稿:網友

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

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 (<=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.

Output

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<cstdio>const int INF=0x7fffffff;const int maxn=1000010;int a[maxn],b[maxn];int main(){ int n1,n2; scanf("%d",&n1); for(int i=0;i<n1;i++){ scanf("%d",&a[i]); } scanf("%d",&n2); for(int i=0;i<n1;i++){ scanf("%d",&b[i]); } a[n1]=b[n2]=INF;//防止在掃描過程中,其中一個序列已掃描完,但還沒到中位數的情況 int pos=(n1+n2-1)/2; int i=0,j=0,count=0; while(count<pos){ if(a[i]<b[j]) i++; else j++; count++; } if(a[i]<b[j])
發表評論 共有條評論
用戶名: 密碼:
驗證碼: 匿名發表
主站蜘蛛池模板: 黑水县| 永仁县| 井冈山市| 通辽市| 孙吴县| 奈曼旗| 禄丰县| 新龙县| 马公市| 和平县| 会泽县| 焉耆| 正定县| 通许县| 弋阳县| 永定县| 芦溪县| 启东市| 阿克苏市| 喜德县| 浪卡子县| 黄梅县| 汉中市| 新巴尔虎右旗| 彰化县| 蕲春县| 慈溪市| 荆州市| 蒲江县| 都江堰市| 麦盖提县| 安多县| 纳雍县| 荔波县| 阳东县| 新兴县| 霞浦县| 潞城市| 咸丰县| 启东市| 辽宁省|