881. Boats to Save People

You are given an array people where people[i] is the weight of the ith person, and an infinite number of boats where each boat can carry a maximum weight of limit. Each boat carries at most two people at the same time, provided the sum of the weight of those people is at most limit.

Return the minimum number of boats to carry every given person.

Example 1:

Input: people = [1,2], limit = 3
Output: 1
Explanation: 1 boat (1, 2)

Example 2:

Input: people = [3,2,2,1], limit = 3
Output: 3
Explanation: 3 boats (1, 2), (2) and (3)

Example 3:

Input: people = [3,5,3,4], limit = 5
Output: 4
Explanation: 4 boats (3), (3), (4), (5)

Constraints:

• 1 <= people.length <= 5 * 104
• 1 <= people[i] <= limit <= 3 * 104

题目：问需要最小船的个数，每艘船不能超过最大载重量limit，不能超过最大人数2. 典型的双指针算法。先将体重由小到大排序，然后根据首尾位置相加和小于limit确定首尾指针位置（使用二分查找法）。注意，这里需要用upper_bound, 因为可能有相同的体重，用lower_bound会导致结果不正确。代码如下：

class Solution {
public:
    int numRescueBoats(vector<int>& people, int limit) {
        sort(people.begin(), people.end());
        int i = 0, j = people.size()-1;
        auto pos = upper_bound(people.begin(), people.end(), limit - people[0]);
        j = pos - people.begin() - 1;
        int res = people.size() - j - 1;
        while(i < j){
            int sum = people[i] + people[j];
            if(sum <= limit){
                i++;
                j--;
            } else {
                j--;
            }
            res++;
        }
        if(i == j) res++;
        return res;
    }
};