提出詳細
ソースコード
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>
#include <cstring>
#define rep(i, m, n) for(int i=int(m);i<int(n);i++)
#define all(c) begin(c),end(c)
template<typename T1, typename T2>
inline void chmin(T1 &a, T2 b) { if (a > b) a = b; }
template<typename T1, typename T2>
inline void chmax(T1 &a, T2 b) { if (a < b) a = b; }
typedef long long int ll;
using ll = long long int;
using ull = long long unsigned int;
using Int = long long int;
using namespace std;
#define INF (1 << 30) - 1
#define INFl (ll)5e15
#define DEBUG 0
#define dump(x) cerr << #x << " = " << (x) << endl
#define MOD 1000000007
//edit
class Solve {
public:
void solve() {
Int N, B;
cin >> N >> B;
vector<Int> W(N), V(N);
vector<Int> dp(B + 1, -1);
dp[0] = 0;
for (int i = 0; i < N; ++i) {
cin >> W[i] >> V[i];
}
for (int i = 0; i < N; ++i) {
for (int j = B; j >= 0; --j) {
if (j + W[i] <= B && dp[j] != -1) {
if (dp[j + W[i]] == -1) dp[j + W[i]] = dp[j] + V[i];
chmax(dp[j + W[i]], dp[j] + V[i]);
}
}
}
Int key = 0;
Int ans = 0;
for (int i = 0; i <= B; ++i) {
if (ans <= dp[i]) {
ans = dp[i];
key = i;
}
}
cout << key << " " << ans << endl;
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
Int T;
cin >> T;
for (int i = 1; i <= T; ++i) {
cout << "Case #" << i << ":" << endl;
Solve().solve();
}
return 0;
}
提出情報
提出出力結果
テストケース情報
京都産業大学コンピュータ理工学部