Pagini recente » Cod sursa (job #1674391) | Cod sursa (job #1335120) | Cod sursa (job #3260212) | Cod sursa (job #2096208) | Cod sursa (job #2741052)
#include <bits/stdc++.h>
using namespace std;
class InParser {
private:
FILE *fin;
char *buff;
int sp;
char read_ch() {
++sp;
if (sp == 4096) {
sp = 0;
fread(buff, 1, 4096, fin);
}
return buff[sp];
}
public:
InParser(const char* nume) {
fin = fopen(nume, "r");
buff = new char[4096]();
sp = 4095;
}
InParser& operator >> (int &n) {
char c;
while (!isdigit(c = read_ch()) && c != '-');
int sgn = 1;
if (c == '-') {
n = 0;
sgn = -1;
} else {
n = c - '0';
}
while (isdigit(c = read_ch())) {
n = 10 * n + c - '0';
}
n *= sgn;
return *this;
}
};
class OutParser {
private:
FILE *fout;
char *buff;
int sp;
void write_ch(char ch) {
if (sp == 50000) {
fwrite(buff, 1, 50000, fout);
sp = 0;
buff[sp++] = ch;
} else {
buff[sp++] = ch;
}
}
public:
OutParser(const char* name) {
fout = fopen(name, "w");
buff = new char[50000]();
sp = 0;
}
~OutParser() {
fwrite(buff, 1, sp, fout);
fclose(fout);
}
OutParser& operator << (int vu32) {
if (vu32 <= 9) {
write_ch(vu32 + '0');
} else {
(*this) << (vu32 / 10);
write_ch(vu32 % 10 + '0');
}
return *this;
}
};
int dp[2][5001], w[5001], p[5001];
int main() {
InParser cin("rucsac.in");
OutParser cout("rucsac.out");
int n, g;
cin >> n >> g;
for(int i = 1; i <= n; i++)
cin >> w[i] >> p[i];
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= g; j++) {
if(w[i] > j)
dp[i%2][j] = dp[(i-1)%2][j];
else
dp[i%2][j] = max(dp[(i-1)%2][j], dp[(i-1)%2][j-w[i]] + p[i]);
}
}
cout << dp[n%2][g];
}