Lunch Rush

Codeforces

Easy

Arrays

Math

Greedy

Lunch Rush

Choose the restaurant that maximizes your profit after accounting for the hunger of the customers and the restaurant's delay penalty.

Acceptance 0%

Start Practice

Problem Statement

N friends are going to have lunch. For the $i$ -th restaurant, you know two values:

$f_i$ : the amount of money you would gain if you eat there.
$s_i$ : the number of friends who will become unhappy because of the waiting time.

Your actual profit from choosing restaurant $i$ is:

$profit_i = f_i - s_i$

Your task is to find the maximum possible profit among all restaurants.

Idea

This is a direct evaluation problem: compute the profit for each restaurant and keep the best one.

Input Format

The first line contains an integer $n$ — the number of restaurants.
The next $n$ lines each contain two integers $f_i$ and $s_i$ .

Output Format

Print one integer — the maximum value of $f_i - s_i$ over all restaurants.

Constraints

$1 \le n \le 100$
$1 \le f_i, s_i \le 100$

Examples

Sample cases returned by the problem API.

Example 1

Input

Output

Explanation

The profits are 8-1=7, 4-4=0, and 5-2=3. The maximum is 7.

Premium problem context

Unlock deeper context for this problem

Premium adds guided hints, editorial links, similar variants, discussion resources, and concept maps so you can understand why a problem matters, not just solve it once.

Guided hints

Editorial and discussion links

Concept map and variants

Track your progress