卬高杯
提出id | 提出時刻 | ユーザー名 | 問題 | 言語 | 判定状況 | 判定 | 実行時間 |
---|---|---|---|---|---|---|---|
114875 | 2023-10-24 09:35:52 | rk42745417 | H | cpp | 19/19 | TLE | 88 |
#include <iostream>
#include <vector>
signed main() {
int n, m;
std::cin >> n >> m;
std::vector<int> dp(m);
std::vector<int> x(n), y(n);
for (int &a : x)
std::cin >> a;
for (int &a : y)
std::cin >> a;
for (int i = 0; i < n; i++)
for (int j = m - 1; j >= y[i]; j--)
dp[j] = std::max(dp[j], dp[j - y[i]] + x[i]);
std::cout << dp[m - 1] << '\n';
}
sample1.txt TLE 85 sample2.txt TLE 85 sample3.txt TLE 84 case1.txt TLE 87 case2.txt TLE 86 case3.txt TLE 86 case4.txt TLE 85 case5.txt TLE 85 case6.txt TLE 85 case7.txt TLE 85 case8.txt TLE 88 case9.txt TLE 86 case10.txt TLE 86 case11.txt TLE 85 case12.txt TLE 85 case13.txt TLE 86 case14.txt TLE 85 case15.txt TLE 85 case16.txt TLE 85 88 RE88 TLE
timeout: the monitored command dumped core Segmentation fault