摘要：
简单的题目class KeyDungeonDiv2{public: int countDoors(vector doorR, vector doorG, vector 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 ++;... 阅读全文