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 Java8 (OpenJDK 1.8.0) (judge verdict: Runtime Error)

import java.util.Arrays;
import java.util.Scanner;

public class Main {
	public static void main(String[]args) {
		try(Scanner scan = new Scanner(System.in)){
			int N = scan.nextInt();
			int[]H = new int[N];
			
			for(int i =0;i<N;i++) {
				H[i] = scan.nextInt();
			}
			
			int[]nH = new int[N];
			for(int i =0;i<N;i++) {
				nH[i] = H[i];
			}
			
			Arrays.sort(nH);
			
			String S = "Yes";
			if(N==1) {
				System.out.println("Yes");	
			}else if(N==2) {
				if(H[1]<H[0]) {
					H[1]--;
				}
				if(H[1]>=H[0]) {
					System.out.println("Yes");
				}else {
					System.out.println("No");
				}		
			}else {
				
				for(int i = 1;i<=N-2;i++) {
					if(H[i]>H[i+1]&&H[i]>H[i-1]) {
						H[i]--;
						
						if(H[i]>H[i+1]) {
							S = "No";
							break;
							}	
						}
					}
			
			
			
			
			for(int i=0;i<N;i++) {
				if(H[i]!=nH[i]) {
					S="No";
				}
				
				//System.out.print(H[i]);
				//System.out.print("  ");
				//System.out.print(nH[i]);
				//System.out.println();
			}
			
			
			
			
			
			System.out.println(S);
		
			
			
			}
			
			
		}
		
		
	}
		

}