public int merge(int[] population) {
		Arrays.sort(population);
		int count = 0;
		for (int i = 0; i < population.length; i++) {
			long plus = 0;
			for (int j = 0; j < i; j++) {
				plus += population[j];
			}
			boolean clear = true;
			for (int j = i + 1; j < population.length; j++) {
				if (population[i] + plus < population[j]) {
					clear = false;
					break;
				} else {
					plus += population[j];
				}
			}
			if (clear) {
				count++;
			}
		}
		return count;
	}