### PROBLEM LINK:

**Author:** Sunny Aggarwal

**Tester:** Vasya Antoniuk

**Editorialist:** Pushkar Mishra

### DIFFICULTY:

Cakewalk

### PREREQUISITES:

Ad-hoc

### PROBLEM:

Given are the number of apples (N) and oranges(M) and k, i.e., the amount of money that chef has to buy apples/oranges. Each orange/apple costs 1 unit. What is the minimum difference that can be achieved.

### EXPLANATION:

The problem is a very direct one. We have to minimize the difference. We can only increase the number of apples or oranges that we have. The logical step is to increase that commodity which is less because increasing the which is already more will only increase the the difference. Let minC denote the quantity which is less. Let maxC be the quantity which is more. The answer is given by:

ans = maxC - min(minC+k, maxC)

We have a min operation in the second term because the optimal case is to make both the quantities equal. If we have enough money to increase the lesser one to more than the other one, then we would rather make them equal so as to have a difference of zero, which is optimal.

### COMPLEXITY:

\mathcal{O}(1) per test case.