public int merge2(int[] population) {
		long[] sum_table = new long[population.length + 1];
		Arrays.sort(population);
		int count = 0;
		for (int i = 0; i < population.length; i++) {
			long plus = sum_table[i];
			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++;
			}

			sum_table[i + 1] = population[i] + sum_table[i];
		}
		return count;
	}