题解 | #牛的体重排序#

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param weightsA int整型vector 
     * @param weightsB int整型vector 
     * @return double浮点型
     */
    double findMedianSortedArrays(vector<int>& weightsA, vector<int>& weightsB) {
        // write code here
        for (int i = 0; i < weightsB.size(); ++i)
            weightsA.push_back(weightsB[i]);
        sort(weightsA.begin(), weightsA.end());
        int num = weightsA.size();
        int x = num / 2 - 1;
        if (num % 2)
            return weightsA[x + 1];
        else  
            return (weightsA[x] + weightsA[x + 1]) / 2.0;
    }
};