Pagini recente » Cod sursa (job #1391062) | Cod sursa (job #2871521) | Cod sursa (job #699298) | Cod sursa (job #1976693) | Cod sursa (job #1088283)
#include <fstream>
using namespace std;
ifstream is("energii.in");
ofstream os("energii.out");
int G, W;
int E[10001], C[10001];
int a[1001][5001];
int main()
{
is >> G >> W;
for ( int i = 1; i <= G; ++i )
is >> E[i] >> C[i];
for ( int i = 1; i <= G; ++i )
for ( int j = 0; j <= W; ++j )
{
a[i][j] = a[i - 1][j];
if ( j <= C[i] && a[i][j] < a[i - 1][j - C[i]] + C[i] )
a[i][j] = a[i - 1][j - C[i]] + C[i];
}
/* for ( int i = 1; i <= G; ++i )
{
for ( int j = 0; j <= W; ++j )
os << a[i][j] << ' ';
os << '\n';
}*/
os << a[G][W];
is.close();
os.close();
return 0;
}