Untitled

class Solution {
public:
    int maxCount(vector<int>& banned, int n, int maxSum) {
        unordered_map < int , bool > seen;
        
        for(int i=0;i<banned.size();i++) {
            seen[banned[i]] = true;
        }
        
        int cnt = 0;
        
        for(int i=1;i<=n;i++) {
            if(seen[i])continue;
            
            if(maxSum - i >= 0) {
                maxSum-=i;
                cnt++;
            }
        }
        
        return cnt;
    }
};