原题:https://pintia.cn/problem-sets/15/problems/3001
题目要求:
思路很简单,创建两个vector容器,将其中一个插入另一个,再将这个容器排序,输出中位数即可。
#include
#include
#include
using namespace std;
int mid(vector& v1, vector& v2, int m)
{
for (int i = 0; i < m; i++)
{
v1.push_back(v2[i]);
}
sort(v1.begin(), v1.end());
return (v1[m] + v1[m - 1]) / 2;
}
int main()
{
vectorv1;
vectorv2;
int m, n;
scanf_s("%d", &m);
for (int i = 0; i < m; i++)
{
scanf_s("%d", &n);
v1.push_back(n);
}
for (int i = 0; i < m; i++)
{
scanf_s("%d", &n);
v2.push_back(n);
}
print