描述:
Xxy is the king of the universe. In order to resist the invasion, he ordered the construction of many space warships.Now,he wants to charge his space ships.
He has N space ships.The N ships are numbered from 1 to N and lined up in order.
Xxy has M charging plans.The i-th plan is describe by two positive integers li,ri.It means in this plan, he will charge the ships numbered from li to ri.
Xxy will choose some of these plan.If he totally choose tot plans,x is the number of ships that charged in every plans.Xxy want to maximize the value of min(tot,x).
输入:
The first line contains two positive integers N and M(N,M≤300000).
The next M lines,each containing two positive integers li and ri.(li≤ri)
输出:
The output contains a positive integer. The maximal value of min(tot,x).
样例输入:
3 3 1 3 2 2 1 2
样例输出:
2
原题链接:Charging | JXNUOJ
描述:
xxy是宇宙之王。为了抵抗入侵,他下令建造了很多宇宙战舰。现在,他想为他的飞船收费。
他有N艘飞船。这N艘飞船从1到N按顺序排列编好号。
xxy有M种收费方案。第i个方案由两个正整数li,ri描述。意思是,在这个方案中,他将向编号为li到ri的飞船收费。
xxy将要选择这些方案中的一些。如果他总共选择了tot个方案,x就是在每一个方案中需要收费的飞船个数。xxy想要最大化min(tot,x)的价值。
输入:
第一行包含两个正整数N和M(N,M≤300000)。
接下来的M行,每一行包含两个正整数li和ri。(li≤ri)
输出:
输出一个正整数,min(tot,x)最大化的价值。