public static int fillMinCost(int size, int amount) {
		minCost = new int[size + 1];
		Arrays.fill(minCost, INF);
		int index =  size;
		minCost[0] = 0;
		for (int i = 0; i < V.length; i++) 
			for (int j = size-V[i]; j >= 0; j--) {
				if (minCost[j] != INF) 
					minCost[j + V[i]] = Math.min(minCost[j + V[i]], minCost[j]+1);
				if (j+ V[i] >= amount && minCost[j+ V[i]] != INF) 
					index = Math.min(j+ V[i],index);
			}
		return index;
	}