이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, m, x, ans = 0;
cin >> n >> m;
unordered_multiset<int64_t> prices;
for (int64_t i = 0; i < n; i++) {
cin >> x;
prices.insert(x);
}
map<int64_t, int64_t> dp;
dp[0] = 1;
for (const int64_t &price : prices) {
for (int64_t i = 1; i <= m; i++) {
if (i - price < 0) {
continue;
}
dp[i] += dp[i - price];
}
}
for (const auto &[a, b] : dp) {
ans = max(ans, b + 1);
}
cout << ans << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |