Problem Description

When playing DotA with god-like rivals and pig-like team members, you have to face an embarrassing situation: All your teammates are killed, and you have to fight 1vN.

There are two key attributes for the heroes in the game, health point (HP) and damage per shot (DPS). Your hero has almost infinite HP, but only 1 DPS.

To simplify the problem, we assume the game is turn-based, but not real-time. In each round, you can choose one enemy hero to attack, and his HP will decrease by 1. While at the same time, all the lived enemy heroes will attack you, and your HP will decrease by the sum of their DPS. If one hero's HP fall equal to (or below) zero, he will die after this round, and cannot attack you in the following rounds.

Although your hero is undefeated, you want to choose best strategy to kill all the enemy heroes with minimum HP loss.

 

Input

The first line of each test case contains the number of enemy heroes N (1 <= N <= 20). Then N lines followed, each contains two integers DPSi and HPi, which are the DPS and HP for each hero. (1 <= DPSi, HPi <= 1000)

 

Output

Output one line for each test, indicates the minimum HP loss.

 

Sample Input

1 10 2 2 100 1 1 100

 

Sample Output

20 201

 

//英语是硬伤。。。要不是看了别人的题解，我真心不知道原来输入时浮点型呀！！！

//这道题直接给我弄迷糊了。。。

//血量少攻击高的要先消灭，即将所有的敌人根据DPS/HP从大到小排序，如果相等，则按HP从小到大排序。

 

#include 
      
       #include 
       
        using namespace std;struct node{    double hp;    double dps;    double bi;} data[25];bool cmp(const node &a,const node &b){   if(a.bi>b.bi)   return true;   else if(a.bi==b.bi)   {       if(a.dps
        
         >n)    {        ans=0;        for(int i=0;i
         
          >data[i].hp>>data[i].dps;            data[i].bi=data[i].dps/data[i].hp*1.0;        }        sort(data,data+n,cmp);        for(int i=0;i