日韩性视频-久久久蜜桃-www中文字幕-在线中文字幕av-亚洲欧美一区二区三区四区-撸久久-香蕉视频一区-久久无码精品丰满人妻-国产高潮av-激情福利社-日韩av网址大全-国产精品久久999-日本五十路在线-性欧美在线-久久99精品波多结衣一区-男女午夜免费视频-黑人极品ⅴideos精品欧美棵-人人妻人人澡人人爽精品欧美一区-日韩一区在线看-欧美a级在线免费观看

歡迎訪問 生活随笔!

生活随笔

當前位置: 首頁 > 编程资源 > 编程问答 >内容正文

编程问答

九度OnlineJudge之1004:Median

發(fā)布時間:2025/3/14 编程问答 24 豆豆
生活随笔 收集整理的這篇文章主要介紹了 九度OnlineJudge之1004:Median 小編覺得挺不錯的,現(xiàn)在分享給大家,幫大家做個參考.
題目描述:

??? 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 non-decreasing 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.

輸入:

??? Each input file may contain more than 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.

輸出:

??? For each test case you should output the median of the two given sequences in a line.

樣例輸入:
4 11 12 13 14 5 9 10 15 16 17
樣例輸出:?????????? 13#include <iostream> #include <vector> #include <algorithm> using namespace std;int main() { vector<long> vec;int size1=0,size2=0; long t=0; while(cin>>size1) {int n1=size1;vec.clear();while(n1--){cin>>t;vec.push_back(t);}cin>>size2;int n2 =size2;while(n2--){cin>>t;vec.push_back(t);}sort(vec.begin(),vec.end());int s=size1+size2; if(s%2) cout<<*(vec.begin()+s/2)<<endl; else cout<<*(vec.begin()+s/2-1)<<endl;}//system("pause");return 0; }

轉載于:https://www.cnblogs.com/ainima/p/6331260.html

總結

以上是生活随笔為你收集整理的九度OnlineJudge之1004:Median的全部內容,希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯,歡迎將生活随笔推薦給好友。