Input
Output
#include <iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;
struct Jinzi
{
int dj,tj;
} jinzi[1005];
bool cmp(Jinzi a,Jinzi b)
{
return a.dj>b.dj;
}
int main()
{
int n,m,i;
int max;
while(cin>>m&&m)
// while(scanf("%d%d",&m,&n)!=EOF&&m!=0)
{
cin>>n;
for( i=0; i<n; i++)
{
scanf("%d%d",&jinzi[i].dj,&jinzi[i].tj);
}
sort(jinzi,jinzi+n,cmp);
max=0;
for( i=0; i<n; i++)
{
if(m>=jinzi[i].tj)
{
m-=jinzi[i].tj;
max+=jinzi[i].dj*jinzi[i].tj;
}
else
{
max+=m*jinzi[i].dj;
break;
}
}
printf("%d\n",max);
}
return 0;
}