[leetcode] 948. Bag of Tokens : https://leetcode.com/problems/bag-of-tokens/

Bag of Tokens.cc

class Solution {
public:
    int bagOfTokensScore(vector<int>& tokens, int P) {
        sort(tokens.begin(),tokens.end());
        int r = tokens.size() - 1;
        int ans = 0;
        int point = 0;
        for(int i=0; i<min((int)tokens.size(), r + 1); i++){
            int now = tokens[i];
            if(now > P && 0 < point){
                point--;
                P += tokens[r--];
            }
            if(now > P)
                break;
            
            point++;
            P -= now;
            ans = max(ans, point);
        }
        return ans;
    }
};