2389. Longest Subsequence With Limited Sum 26 DEC

class Solution {
public:
    int find(vector<int>&a,int x){
        
        int ans = -1;
        int l =0,r = a.size()-1;
        while(l<=r){
            int mid = (l+r)/2;
            if(a[mid]<=x){
                ans = mid;
                l =mid+1;
            }
            else r = mid-1;
        }
        return ans+1;
    }
    vector<int> answerQueries(vector<int>& a, vector<int>& q) {
        sort(a.begin(),a.end());
        for(int i=1;i<a.size();i++){
            a[i] +=a[i-1];
        }
        vector<int>res;
        for(auto it:q)
        {
            res.push_back(find(a,it));
        }
        
        return res;
    }
};