Pagini recente » Cod sursa (job #2398341) | Cod sursa (job #2782129) | Cod sursa (job #2615352) | Cod sursa (job #1685227) | Cod sursa (job #1549323)
#include <iostream>
#include <fstream>
#define N_MAX 20001
#define G_MAX 75001
using namespace std;
ifstream fin("ghiozdan.in");
ofstream fout("ghiozdan.out");
int g[N_MAX], an[G_MAX];
bool af[N_MAX][G_MAX];
int main() {
int N, G;
fin >> N >> G;
for (int i = 1; i <= N; i++) {
fin >> g[i];
for (int j = G - g[i]; j >= 0; j--) {
if (an[j] != 0 || j == 0) {
int k = j + g[i];
if (an[k] == 0 || an[j] + 1 < an[k]) {
an[k] = an[j] + 1;
for (int o = 1; o <= N; o++)
af[o][k] = af[o][j];
af[i][k] = true;
}
}
}
}
int k = G;
while (an[k] == 0)
k--;
fout << k << " " << an[k] << "\n";
for (int o = 1; o <= N; o++)
if (af[o][k])
fout << g[o] << "\n";
return 0;
}