codeforce Valera and Plates

 Valera and Plates

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Input

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 a1, a2, ..., an (1 ≤ ai ≤ 2). If ai equals one, then on day i Valera will eat a first type dish. If aiequals two, then on day i Valera will eat a second type dish.

Output

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

Sample test(s)

input

3 1 1
1 2 1

output

1

input

4 3 1
1 1 1 1

output

1

input

3 1 2
2 2 2

output

0

input

8 2 2
1 2 1 2 1 2 1 2

output

4

Note

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.

这题不难，昨晚在比赛时间内做的时候，就感觉特别简单，可是没有想到的是自己因为细节的地方被hacked了，心多少难免是有点不甘的，很多时候，发现自己练了那么多，水平是在不断的提高，但是细节错误也越来越多，很不甘心。可是自己却很害怕去改正错误，很害怕去面对错误，所以犯错误越来越多。

题目意思很简单，就是说有那么一个人很懒，想要吃饭，有碗m个和碟子k个，计划在n天呢，他要洗多少次碗，题目是有限制的，吃第一道菜的时候只能用bowl，而第二道才可以用bolw or plates.

#include<stdio.h>

int n,m,k;
int A[1005];


int main()
{
    scanf("%d %d %d", &n, &m, &k);
    int a;
    int x,count=0;
    while(n--)
    {
        scanf("%d", &x);
        if(2==x && k>0)
            --k;
        else if(2==x && m>0)
            --m;
        else if(1==x && m>0)
            --m;
        else
            ++count;
    }
    printf("%d\n", count);
    return 0;
}