C++ 实现巧克力装包问题：最大装包数量

#include #include #include using namespace std;

const int MAXN = 50005;

int n, m; long long a[MAXN]; vector preSum;

int binarySearch(long long x) { int l = 0, r = preSum.size() - 1; while (l <= r) { int mid = (l + r) / 2; if (preSum[mid] <= x) { l = mid + 1; } else { r = mid - 1; } } return l; }

int main() { cin >> n >> m; for (int i = 1; i <= n; i++) { cin >> a[i]; a[i] *= a[i]; } sort(a + 1, a + n + 1); preSum.push_back(0); for (int i = 1; i <= n; i++) { preSum.push_back(preSum.back() + a[i]); } for (int i = 1; i <= m; i++) { long long q; cin >> q; int ans = binarySearch(q); cout << ans - 1 << endl; } return 0; }