Valera and Plates

题意翻译

Valera有m个干净的碗和k个干净的盘子，在接下来的n天中，他每天要吃一道菜。菜分两种，第一种必须用一个干净的碗，第二种可以用一个干净的碗或一个干净的盘子，用完后碗或盘子就会变脏，再次使用就要清洗，现在给定每天吃哪种菜，请你安排每天使用碗还是盘子，使得清洗的次数最少

题目描述

Valera is a lazy student. He has $ m $ clean bowls and $ k $ clean plates. Valera has made an eating plan for the next $ n $ days. As Valera is lazy, he will eat exactly one dish per day. At that, in order to eat a dish, he needs exactly one clean plate or bowl. We know that Valera can cook only two types of dishes. He can eat dishes of the first type from bowls and dishes of the second type from either bowls or plates. When Valera finishes eating, he leaves a dirty plate/bowl behind. His life philosophy doesn't let him eat from dirty kitchenware. So sometimes he needs to wash his plate/bowl before eating. Find the minimum number of times Valera will need to wash a plate/bowl, if he acts optimally.

输入输出格式

输入格式

The first line of the input contains three integers $ n $ , $ m $ , $ k $ ( $ 1<=n,m,k<=1000 $ ) — the number of the planned days, the number of clean bowls and the number of clean plates. The second line contains $ n $ integers $ a_{1},a_{2},...,a_{n} $ ( $ 1<=a_{i}<=2 $ ). If $ a_{i} $ equals one, then on day $ i $ Valera will eat a first type dish. If $ a_{i} $ equals two, then on day $ i $ Valera will eat a second type dish.

输出格式

Print a single integer — the minimum number of times Valera will need to wash a plate/bowl.

输入输出样例

输入样例 #1

3 1 1
1 2 1

输出样例 #1

1

输入样例 #2

4 3 1
1 1 1 1

输出样例 #2

1

输入样例 #3

3 1 2
2 2 2

输出样例 #3

0

输入样例 #4

8 2 2
1 2 1 2 1 2 1 2

输出样例 #4

4

说明

In the first sample Valera will wash a bowl only on the third day, so the answer is one. In the second sample, Valera will have the first type of the dish during all four days, and since there are only three bowls, he will wash a bowl exactly once. In the third sample, Valera will have the second type of dish for all three days, and as they can be eaten from either a plate or a bowl, he will never need to wash a plate/bowl.