TopCoder SRM 588 DIV2 KeyDungeonDiv2

简单的题目

class KeyDungeonDiv2
{
public:
    int countDoors(vector <int> doorR, vector <int> doorG, vector <int> keys)
    {
        int res = 0;
        for(int i = 0 ; i < doorR.size(); i ++){
            if(doorR[i]  <= keys[0]+keys[2] && doorG[i] <= keys[1]+keys[2] && doorR[i] + doorG[i] <=keys[0]+keys[1]+keys[2]) res ++;
        }
        return res;
    }
};

 

转载于:https://www.cnblogs.com/xiongqiangcs/p/3258390.html