Day58: [PAT甲级] 1029 Median (25分)
题源:
来自PAT真题库:
https://pintia.cn/problem-sets/994805342720868352/problems/994805466364755968
代码:
dirty code凑合看吧
#include<iostream>
#include<string>
#include<sstream>
#include<vector>
#include<map>
#include<unordered_map>
#include<queue>
#include<set>
#include<unordered_set>
#include<cstdio>
#include<algorithm>
using namespace std;
int N1, N2;
vector<int> v1, v2;
int main() {
cin >> N1;
int x;
for (int i = 0;i<N1;i++) {
scanf("%d",&x);
v1.push_back(x);
}
cin >> N2;
for (int i = 0; i < N2; i++) {
scanf("%d",&x);
v2.push_back(x);
}
int i, j,mid,count=0,res=-99;
if ((N1 + N2) / 2 == 0) {
mid = (N1 + N2) / 2;
}else mid = (N1 + N2) / 2+1;
for (i=v1.size()-1,j=v2.size()-1;i>=0&&j>=0;) {
if (v1[i] > v2[j]) {
count++;
if (count == mid) {
res = v1[i];
break;
}
i--;
}
else {
count++;
if (count == mid) {
res = v2[j];
break;
}
j--;
}
}
if (count == mid) cout << res;
else {
if (i >= 0) {
cout << v1[i - (mid - count) + 1];
}
else {
cout << v2[j - (mid - count) + 1];
}
}
system("pause");
}