Leetcode 2279. Maximum Bags With Full Capacity of Rocks

将袋子的剩余空间从小到大的排序，greedy的填满袋子即可

class Solution {
public:
    int maximumBags(vector& capacity, vector& rocks, int additionalRocks) {
        int n = capacity.size();
        vector remain(n,0);
        for(int i=0;i
            remain[i] = capacity[i] - rocks[i];
        }
        sort(remain.begin(),remain.end());
        int ans = 0;
        for(int i=0;i
            if(remain[i] == 0){
                ans++;
            }else{
                additionalRocks -= remain[i];
                ans++;
                if(additionalRocks <= 0) break;
            }
        }
        if(additionalRocks < 0) ans--;
        return ans;
    }
};