Cod sursa(job #1209493)
Utilizator | Diana Pislaru dianaa21 | Data | 17 iulie 2014 20:42:22 |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
#include <iomanip>
using namespace std;
ifstream is ("rucsac.in");
ofstream os ("rucsac.out");
int n, g, s;
int a[10001], P[5001], G[5001];
void Read();
int main()
{
Read();
a[0] = 0;
for(int i = 1; i <= n; ++i)
for(int j = g - G[i]; j >= 0; --j)
{
if(a[j + G[i]] < a[j] + P[i])
{
a[j + G[i]] = a[j] + P[i];
s = max(s, a[j + G[i]]);
}
}
os << s;
return 0;
}
void Read()
{
is >> n >> g;
for(int i = 1; i <= n; ++i)
is >> G[i] >> P[i];
}