B"The only difference between easy and hard versions is constraints. Ivan plays a computer game that contains some microtransactions to make characters look cooler. Since Ivan wants his character to be really cool, he wants to use some of these microtransactions -- and he won't start playing until he gets all of them. Each day (during the morning) Ivan earns exactly one burle. There are n types of microtransactions in the game. Each microtransaction costs 2 burles usually and 1 burle if it is on sale. Ivan has to order exactly k_i microtransactions of the i -th type (he orders microtransactions during the evening). Ivan can order any (possibly zero) number of microtransactions of any types during any day (of course, if he has enough money to do it). If the microtransaction he wants to order is on sale then he can buy it for 1 burle and otherwise he can buy it for 2 burles. There are also m special offers in the game shop. The j -th offer (d_j, t_j) means that microtransactions of the t_j -th type are on sale during the d_j -th day. Ivan wants to order all microtransactions as soon as possible. Your task is to calculate the minimum day when he can buy all microtransactions he want and actually start playing. The first line of the input contains two integers n and m ( 1 <= n, m <= 2 cdot 10^5 ) -- the number of types of microtransactions and the number of special offers in the game shop. The second line of the input contains n integers k_1, k_2, ... , k_n ( 0 <= k_i <= 2 cdot 10^5 ), where k_i is the number of copies of microtransaction of the i -th type Ivan has to order. It is guaranteed that sum of all k_i is not less than 1 and not greater than 2 cdot 10^5 . The next m lines contain special offers. The j -th of these lines contains the j -th special offer. It is given as a pair of integers (d_j, t_j)$$"...