Problem:
Score : 100 points

Problem Statement

We have two bottles for holding water.

Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.

Bottle 2 contains C milliliters of water.

We will transfer water from Bottle 2 to Bottle 1 as much as possible.

How much amount of water will remain in Bottle 2?

Constraints

All values in input are integers.

1 \leq B \leq A \leq 20

1 \leq C \leq 20

Input

Input is given from Standard Input in the following format:

A B C

Output

Print the integer representing the amount of water, in milliliters, that will remain in Bottle 2.

Sample Input 1

6 4 3

Sample Output 1

1

We will transfer two milliliters of water from Bottle 2 to Bottle 1, and one milliliter of water will remain in Bottle 2.

Sample Input 2

8 3 9

Sample Output 2

4

Sample Input 3

12 3 7

Sample Output 3

0

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <iostream>
#include <cmath>
#include <cstdint>
#include <cstring>
using namespace std;

int main(void){
    int i=0,l,N;
    bool flag=true;

    cin >> N;
    int a[N];
    while (cin >> l) {
        a[i] = l;
        i++;
        if (i >= N) {
            break;
        }
    }

    if(N==1){
        printf("Yes");
        return 0;
    }

    if (a[0]>a[1]){
        a[0]--;
        if(a[0]>a[1]){
            printf("No");
            return 0;
        }
    }
    
    for(i=1;i<N-1;i++){
        if(a[i]>a[i+1]){
            a[i]--;
            if(a[i]<a[i-1]){
                printf("No");
                return 0;
            }
        }
    }
    printf("Yes");
    return 0;
}