zoukankan      html  css  js  c++  java
  • 【PAT】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

    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
    


    分析:寻找中位数。一开始用sort来进行排序后找出中位数,但是这样会有两组数据超时。所以只能进行逐一比较。


    代码:

    #include<iostream>
    #include<vector>
    #include<algorithm>
    using namespace std;
    int main()
    {	
    	int n;
    	long t;
    	int i;
    
    	scanf("%d",&n);
    	vector<long> vec1(n);
    	for(i=0; i<n; i++)
    		scanf("%ld",&vec1[i]);
    
    	scanf("%d",&n);
    	vector<long> vec2(n);
    	for(i=0; i<n; i++)
    		scanf("%ld",&vec2[i]);
    
    	int j,temp = 0;
    	long v;
    	vector<long> result;
    
    	for(i=0,j=0; i<vec1.size() && j<vec2.size(); )
    	{
    		if(vec1[i] <= vec2[j]){
    			v = vec1[i];
    			i++;			
    		}			
    		else{
    			v = vec2[j];
    			j++;
    		}
    		result.push_back(v);
    		if(result.size() == ( vec1.size() + vec2.size() + 1)/2 ){
    			cout<<result[result.size() - 1]<<endl;
    			break;
    		}
    	}
    
    	if(result.size() != ( vec1.size() + vec2.size() + 1)/2)
    	{
    		while(i<vec1.size())
    		{
    			result.push_back(vec1[i]);
    			if(result.size() == ( vec1.size() + vec2.size() + 1)/2 ){
    				cout<<result[result.size() - 1]<<endl;
    				break;
    			}
    			i++;
    		}
    		while(j<vec2.size())
    		{
    			result.push_back(vec2[j]);
    			if(result.size() == ( vec1.size() + vec2.size() + 1)/2 ){
    				cout<<result[result.size() - 1]<<endl;
    				break;
    			}
    			j++;
    		}
    	}
    	return 0;
    }


  • 相关阅读:
    [Windows] 输入字符间距变宽
    [Android] 安卓手机不用root删除自带app
    [Linux] 内核通知链 notifier
    [RK3399] ES8316+NS4150 播放视频只有背景音,播放歌曲有的有声音,有的无声音
    [Linux] RTC 读写指令及测试程序
    [Linux] scp指令用法
    [Ubuntu] sudo apt-get update指令执行失败
    [RK3399] 修改移动网络默认为4G
    [RK3288] 外接USB设备出现丢数
    laravel 模拟数据批量添加
  • 原文地址:https://www.cnblogs.com/pangblog/p/3397829.html
Copyright © 2011-2022 走看看