测评会员优惠活动进行中 · 开通 VIP,有效期内测评不限次 VIP 优惠中 · 测评不限次 立即查看

A11923. Game Shopping

编程题 普及/提高-

题目描述

The first line of the input contains two integers $n$ and $m$ ( $1 \le n, m \le 1000$ ) — the number of games and the number of bills in Maxim's wallet.

The second line of the input contains $n$ integers $c_1, c_2, \dots, c_n$ ( $1 \le c_i \le 1000$ ), where $c_i$ is the cost of the $i$ -th game.

The third line of the input contains $m$ integers $a_1, a_2, \dots, a_m$ ( $1 \le a_j \le 1000$ ), where $a_j$ is the value of the $j$ -th bill from the Maxim's wallet.

输入格式

Print a single integer — the number of games Maxim will buy.

输出格式

The first example is described in the problem statement.

In the second example Maxim cannot buy any game because the value of the first bill in his wallet is smaller than the cost of any game in the shop.

In the third example the values of the bills in Maxim's wallet are large enough to buy any game he encounter until he runs out of bills in his wallet.

输入输出样例

输入 #1
5 4
2 4 5 2 4
5 3 4 6
输出 #1
3
输入 #2
5 2
20 40 50 20 40
19 20
输出 #2
0
输入 #3
6 4
4 8 15 16 23 42
1000 1000 1000 1000
输出 #3
4

说明/提示

The first example is described in the problem statement.

In the second example Maxim cannot buy any game because the value of the first bill in his wallet is smaller than the cost of any game in the shop.

In the third example the values of the bills in Maxim's wallet are large enough to buy any game he encounter until he runs out of bills in his wallet.
上一题 去做题 下一题