1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.util.Arrays;

public final class pak {

	private final static class BackPack implements Comparable<BackPack> {

		public BackPack(BackPack bp) {
			this.weight = bp.weight;
			this.startW = bp.startW;
		}

		public BackPack(int id, int weight) {
			this.weight = weight;
			this.startW = weight;
		}

		int weight;
		int startW;

		@Override
		public int compareTo(BackPack arg0) {

			return weight - arg0.weight;
		}

		@Override
		public String toString() {
			return startW + "[" + weight + "]";
		}

	}

	private static final String SEPARATOR = "\\s+";

	public static InputStream INPUT_STREAM = System.in;
	public static PrintStream PRINT_STREAM = System.out;

	private static void reverse(int[] data) {
		for (int left = 0, right = data.length - 1; left < right; left++, right--) {

			int temp = data[left];
			data[left] = data[right];
			data[right] = temp;
		}
	}

	private static void reverse(BackPack[] data) {
		for (int left = 0, right = data.length - 1; left < right; left++, right--) {

			BackPack temp = data[left];
			data[left] = data[right];
			data[right] = temp;
		}
	}

	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(INPUT_STREAM));

		String[] tmp = br.readLine().split(SEPARATOR);

		int itemsNumber = Integer.parseInt(tmp[0]);
		int backpacksNumber = Integer.parseInt(tmp[1]);

		int[] items = new int[itemsNumber];
		int[] backpacks = new int[backpacksNumber];

		tmp = br.readLine().split(SEPARATOR);
		for (int i = 0; i < items.length; i++) {
			items[i] = Integer.parseInt(tmp[i]);
		}

		tmp = br.readLine().split(SEPARATOR);
		for (int i = 0; i < backpacks.length; i++) {
			backpacks[i] = Integer.parseInt(tmp[i]);
		}

		Arrays.sort(items);
		Arrays.sort(backpacks);
		int bacpkacksOverItems = backpacks.length - items.length;
		if (bacpkacksOverItems > 0) {
			int[] bestBackpacks = new int[items.length];
			System.arraycopy(backpacks, bacpkacksOverItems, bestBackpacks, 0, items.length);
			backpacks = bestBackpacks;
		}

		reverse(items);
		reverse(backpacks);

		int result = heur(items, backpacks);

		if (result < 100000)
			PRINT_STREAM.println(result);
	}

	private static long sum(int[] items, int k) {
		long sum = 0;

		for (int i = 0; i <= k; i++) {
			sum += items[i];
		}

		return sum;

	}

	private static int heur(int[] items, int[] backpacks) {
		boolean[][] t = new boolean[backpacks.length][items.length];

		for (int i = 0; i < backpacks.length; i++) { // plecaki
			for (int k = 0; k < items.length; k++) { // itemy
				if (sum(items, k) > sum(backpacks, i)) {
					break;
				} else {

					if (k < 6) { // MAGIC SIX
						int[] subItems = new int[k + 1];
						int[] subBackpacks = new int[i + 1];

						System.arraycopy(items, 0, subItems, 0, k + 1);
						System.arraycopy(backpacks, 0, subBackpacks, 0, i + 1);

						solve(subItems, subBackpacks);

						if (GLOBAL_RESULT < 100000) {
							t[i][k] = true;
						}

					} else {
						t[i][k] = true;
					}

				}
			}

			if (!t[i][items.length - 1]) {
				continue;
			}

			return i + 1;
		}

		return 100000;
	}

	private static int[] items;

	private static int GLOBAL_RESULT = 100000;

	private static void solve(int[] items, int[] backpacks) {
		GLOBAL_RESULT = 100000;
		pak.items = items;

		BackPack[] backpacksWithIds = new BackPack[backpacks.length];

		for (int i = 0; i < backpacks.length; i++) {
			backpacksWithIds[i] = new BackPack(i, backpacks[i]);
		}

		solve(backpacksWithIds, 0);

		/*
		 * if (GLOBAL_RESULT == 100000) { System.out.println("NIE"); } else {
		 * System.out.println(GLOBAL_RESULT); }
		 */
	}

	private static void solve(BackPack[] backpacks, int newNumber) {

		if (getResult(backpacks) > GLOBAL_RESULT) {
			return;
		}

		if (newNumber < items.length) {
			int weight = items[newNumber];
			int newSize = notBAdBackpacks(backpacks, weight);

			if (newSize == 0) {
				return; // unable to solve
			}

			for (int i = 0; i < newSize; i++) {
				BackPack[] newBackpacks = new BackPack[backpacks.length];

				System.arraycopy(backpacks, 0, newBackpacks, 0, newBackpacks.length);

				/*
				 * for (int j = 0; j < newBackpacks.length; j++) {
				 * newBackpacks[j] = backpacks[j]; }
				 */

				newBackpacks[i] = new BackPack(newBackpacks[i]);
				newBackpacks[i].weight = newBackpacks[i].weight - weight;

				Arrays.sort(newBackpacks);

				reverse(newBackpacks);

				solve(newBackpacks, newNumber + 1);

			}
		} else {

			int result = getResult(backpacks);

			// System.out.println(result + ": " + Arrays.toString(backpacks));
			if (result < GLOBAL_RESULT) {
				// System.out.println("NEW GLOBAL R: " + result);
				GLOBAL_RESULT = result;
			}

		}

	}

	private static int getResult(BackPack[] backpacks) {
		int result = 0;
		for (int i = 0; i < backpacks.length; i++) {
			if (backpacks[i].weight != backpacks[i].startW) {
				result++;
			}
		}
		return result;
	}

	private static int notBAdBackpacks(BackPack[] t, int x) {
		for (int i = 0; i < t.length; i++) {
			if (t[i].weight < x) {
				return i;
			}
		}

		return t.length;
	}
}