2389. Longest Subsequence With Limited Sum

class Solution {
public:
    vector<int> answerQueries(vector<int>& nums, vector<int>& queries) {
        int cnt=0;
        sort(nums.begin(),nums.end());
        vector<int> ans;
        for(auto i:queries){
            int val=i;
            for(auto j:nums){
                if(j<=val){
                    cnt++;
                    val=val-j;
                }
            }
            ans.push_back(cnt);
            cnt=0;
        }
   return ans; }
};