卡牌游戏：计算胜利所需卡牌数 - C++ 代码实现

#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main() {\n int n, b;\n cin >> n >> b;\n \n vector<int> cards(n);\n for (int i = 0; i < n; i++) {\n cin >> cards[i];\n }\n \n sort(cards.begin(), cards.end());\n \n int count = 0;\n int damage = 0;\n for (int i = 0; i < n; i++) {\n damage += cards[i];\n count++;\n if (damage >= b) {\n break;\n }\n }\n \n if (damage < b) {\n count = -1;\n }\n \n cout << count << endl;\n \n return 0;\n}