Cod sursa(job #1549328)

Utilizator vapopescuVlad Andrei Popescu vapopescu Data 12 decembrie 2015 11:28:12
Problema Ghiozdan Scor 42
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.75 kb
#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;
}