http://acm.hdu.edu.cn/showproblem.php?pid=2111
#include<map>
#include<set>
#include<list>
#include<cmath>
#include<ctime>
#include<deque>
#include<stack>
#include<bitset>
#include<cstdio>
#include<vector>
#include<cstdlib>
#include<cstring>
#include<iomanip>
#include<numeric>
#include<sstream>
#include<utility>
#include<iostream>
#include<algorithm>
#include<functional>
using namespace std ;
const int maxn = 1005 ;
struct node
{
int value , num ;
}edge[ maxn ] ;
int cmp( node a , node b )
{
return a.value > b.value ;
}
int main()
{
int n , v , sum ;
while( scanf( "%d" , &v ) != EOF && v )
{
scanf( "%d" , &n ) ;
for( int i = 0 ; i < n ; ++i )
scanf( "%d %d" , &edge[ i ].value , &edge[ i ].num ) ;
sort( edge , edge + n , cmp ) ;
sum = 0 ;
for( int i = 0 ; i < n ; ++i )
{
if( v > edge[ i ].num )
{
sum += edge[ i ].value * edge[ i ].num ;
v -= edge[ i ].num ;
}
else
{
sum += v * edge[ i ].value ;
break ;
}
}
printf( "%d\n" , sum ) ;
}
return 0;
}