2279. Maximum Bags With Full Capacity of Rocks

class Solution {
public:
    int maximumBags(vector<int>& cp, vector<int>& rocks, int ar) {
       int cnt=0;
       for(int i=0;i<cp.size();i++){
           cp[i]=cp[i]-rocks[i];
           //1 1 0 1
       }
       sort(cp.begin(),cp.end());
       //0 1 1 1
       for(auto i:cp){
           if(i==0)
           cnt++;
           else if(ar-i>=0){
               cnt++;
               ar=ar-i;
           }
           else
           break;
       }
   return cnt; }
};