1029. Median (25)
#include <iostream>
#include <vector>
#include <algorithm>using namespace std;int main()
{int n;scanf("%d", &n);int i;long int num;vector<long int> v;for(i = 1; i <= n; i++){scanf("%ld", &num);v.push_back(num);}int m;scanf("%d", &m);for(i = 1; i <= m; i++){scanf("%ld", &num);v.push_back(num);}sort(v.begin(), v.end());n += m;int half;if(n % 2 == 0){half = n / 2 - 1;}else{half = (n + 1) / 2 - 1;}printf("%ld\n", v[half]);system("pause");return 0;
}
本文来自互联网用户投稿，该文观点仅代表作者本人，不代表本站立场。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如若转载，请注明出处：http://www.mzph.cn/news/974048.shtml
如若内容造成侵权/违法违规/事实不符，请联系多彩编程网进行投诉反馈email:809451989@qq.com，一经查实，立即删除！)
)
)
)
)
)
)
)
)
)
)
)