Statement↵
==================↵
You are given a vector of pairs `(x_i, y_i)` for size N.<br>↵
Constraint : `1 <= x_i,y_i <=N` and `N<=1e5` <br>↵
For each j from `1 to1000N`, find out the maximum value of `j*x_i + y_i` amongst all `i`'s from `1 to N`.
==================↵
You are given a vector of pairs `(x_i, y_i)` for size N.<br>↵
Constraint : `1 <= x_i,y_i <=N` and `N<=1e5` <br>↵
For each j from `1 to