CF1251E1 Voting (Easy Version)

简单难度和困难难度的唯一差别是数据范围 有一群选民，你想获得他们全部的选票，而对于第$i$选民，有着一个跟风值$m_i$，如果有其它不低于$m_i$个选民已经投票给你，那么他就会跟风一起投票给你；还有着一个贿赂值$p_i$，如果你可以付出$p_i$个硬币，那么他就会把票投给你 这种投票是分阶段进行的，例如，现在有五个选民他们的跟风值分别是$m_1=1$, $m_2=2$, $m_3=2$, $m_4=4$, $m_5=5$，然后你可以贿赂第五个选民，然后所有选民就会都投票给你，投票给你的选民变化为：$5→1,5→1,2,3,5→1,2,3,4,5$ 现在请你计算出最少需要多少个硬币来让所有选民投票给你

无

无

In the first test case you have to buy vote of the third voter. Then the set of people voting for you will change as follows: $ {3} \rightarrow {1, 3} \rightarrow {1, 2, 3} $ . In the second example you don't need to buy votes. The set of people voting for you will change as follows: $ {1} \rightarrow {1, 3, 5} \rightarrow {1, 2, 3, 5} \rightarrow {1, 2, 3, 5, 6, 7} \rightarrow {1, 2, 3, 4, 5, 6, 7} $ . In the third test case you have to buy votes of the second and the fifth voters. Then the set of people voting for you will change as follows: $ {2, 5} \rightarrow {1, 2, 3, 4, 5} \rightarrow {1, 2, 3, 4, 5, 6} $ .