C++算法：商场购物最大愉悦值问题

{"title":"商场购物最大愉悦值问题","description":"本篇文章讲解了如何使用C++算法解决商场购物最大愉悦值问题。用户需要购买指定数量的商品，使得商品愉悦值之和是给定值的倍数，同时最大化总愉悦值。文章包含详细的代码示例和解释。","keywords":"C++算法, 商场购物, 最大愉悦值, 愉悦值之和, 倍数, 贪心算法, 代码示例","content":"#include\n#include\n#include\nusing namespace std;\n\nint main() {\n int n, m, c;\n cin >> n >> m >> c;\n vector x(n);\n for (int i = 0; i < n; i++) {\n cin >> x[i];\n }\n \n sort(x.begin(), x.end(), greater()); // 按愉悦值从大到小排序\n \n int sum = 0;\n int count = 0;\n for (int i = 0; i < n; i++) {\n sum += x[i];\n count++;\n if (count >= m && sum % c == 0) {\n cout << sum << endl;\n return 0;\n }\n }\n \n cout << -1 << endl;\n return 0;\n}