Problem:
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});

Circle in a Rectangle

Write a program which reads a rectangle and a circle, and determines whether the circle is arranged inside the rectangle. As shown in the following figures, the upper right coordinate $(W, H)$ of the rectangle and the central coordinate $(x, y)$ and radius $r$ of the circle are given.

Input

Five integers $W$, $H$, $x$, $y$ and $r$ separated by a single space are given in a line.

Output

Print "Yes" if the circle is placed inside the rectangle, otherwise "No" in a line.

Constraints

$ -100 \leq x, y \leq 100$

$ 0 < W, H, r \leq 100$

Sample Input 1

5 4 2 2 1

Sample Output 1

Yes

Sample Input 2

5 4 2 4 1

Sample Output 2

No

Solution in JAVA (judge verdict: Wrong Answer)

import java.util.*;

public class Main {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int kaisu = 5;
		int[] num = new int[kaisu];

		for(int i = 0; i < kaisu ; i++) {
			num[i] = scan.nextInt();
		}

		if(num[0] <= num[2]+num[4] | 0 >= num[2]-num[4]) {
			System.out.println("No");
		}else if(num[1] <= num[3]+num[4] | 0 >= num[3]-num[4]) {
			System.out.println("No");
		}else System.out.println("Yes");
	
		/*num = up_down_sort(num);
		for(int i = 0 ; i < kaisu ; i++) {
			if(i != kaisu - 1) System.out.print(num[i] + " ");
			else System.out.println(num[i]);
		}
	}
	
	public static int[] up_down_sort (int[] numbers) {
		int up_number ;
		int down_number ;
		int yousosu = numbers.length;
		for(int i = yousosu-1 ; i >= 0 ; i--) {
			for(int j = i ; j <= yousosu  ; ++j) {
				if(j+1 == yousosu) break;
				if(numbers[j] < numbers[j+1]) {
					break;
				}
				if(numbers[j] > numbers[j+1]) {
					up_number = numbers[j+1];
					down_number = numbers[j];
					numbers[j] = up_number;
					numbers[j+1] = down_number;
				}
			}
		}
		return numbers;
	
		else System.out.println("No");
		if(a < b) System.out.println("a < b");
		else if(a > b) System.out.println("a > b");
		else System.out.println("a == b");
		int[] time_get = henkan(scan.nextInt());
	
		for(int i = 0; i < 3; i++) {
			if(i != 2) System.out.print(time_get[i] + ":" );
			else System.out.println(time_get[i]);
		}

	}

	static int[] henkan(int time_input) {
		int[] times = new int[3];
		times[0] = time_input / 3600;
		time_input = time_input - times[0] * 3600;
		times[1] = time_input /60;
		times[2] = time_input - times[1] * 60;
		
		return times;*/
	}
}