Challenges

Bitwise for Dummies
This is to provide you with an introductory experience of bit-wise ope...
Max. Marks: 6
Solved By : 834
Double the Number
Given an array A of size N and K. count all the number of elements suc...
Max. Marks: 8
Solved By : 923
Rotate Array
You are given an array of N length. You have to rotate the array right...
Max. Marks: 6
Solved By : 1931
Floating Number
Bob has a floating point number N. He wants to set the precision for 2...
Max. Marks: 4
Solved By : 5589
SwapMaster solves Symmetric Swap
The SwapMaster is known to be the greatest and fastest swapper of all ...
Max. Marks: 4
Solved By : 4387
String Matching
Cody has a sequence of characters N. He likes a sequence if it contain...
Max. Marks: 3
Solved By : 2537
Leap Year
Steve is playing a quiz game with his brother John. As Steve just lear...
Max. Marks: 6
Solved By : 3959
Project Teams
There are N students in a class and Teacher want to divide these stude...
Max. Marks: 5
Solved By : 4567
Circle of Numbers
All numbers in NumberLand are standing in a circle for a dancing cerem...
Max. Marks: 6
Solved By : 3131
Happy String
A happy string is a string in which each character is lexicographicall...
Max. Marks: 4
Solved By : 2372
CashBack
loading...
Please select a challenge
Problem Statement
Joel wants to buy N items. He came to know that for each item there is a cash back of some amount. The i th item will have cost Ci dollar and cash back of Xi dollar. Initially, Joel has M dollars. Find the minimum value of M, that Joel must have initially, so Joel can buy all the N items. Note: Joel can buy items in any order.

Input
The first line will contain N, the number of items Joel has to buy. Next, N lines will have two space-separated integers Ci and Xi, representing the cost of the item and cashback Joel will get respectively for ith Item.

Output
Output a single integer M that is the minimum dollars Joel requires initially.

Constraints
1 <= N,Ci,Xi <=10^5

Sample Input
2
1 1
2 1

Sample Output

2

Dcoded By: Bhanu Nadar

Solved By: 489

Maximum Marks: 15