Xavier needs to defuse N bombs from $1$ to N$.$

Every ith bomb is gonna explode in Y$\_\{1\}$ seconds. He takes X$\_\{$i$\}$ seconds to defuse th bomb and he must defuse this bomb before or at this time to survive.He can only defuse one bomb at a time.

Xavier having this information beforehand has reached out to you for your help. Rescue Xavier to let him know if it is safe for him to defuse all the bombs. If he can, return minimum time by which all the bombs can be defused; if he cannot, return $-1.$

Example:

N: $5$

bombinfo:

$[[2,4]$

$[1,9]$

$[1,8]$

$[4,9]$

$[3,12]]$

Give c$++$ code for these constraints

$[$input$]$ integer n

$1<=$ N $<=2*10^5$

$[$input$]$ array.array.integer bombinfo

bombinfo is a given $2$D array of N Rows and $2$ columns

X$\_$i represents time taken by Xavier to defuse i

th bomb Y$\_$i represents time by which ith bomb will explode

$1<=$ X$\_\{$i$\},$ Y$\_$i $<=10^9(1<=$ i$<=$N$)$

$[$output$]$ integer$64$