zoj 2109

/*
zoj_2109    贪心
简单贪心
*/
#include <iostream>
#include <cstdio>
#include <string.h>
#include <algorithm>
using namespace std;
struct node
{
    double j,f,rate;
};
node trade[1010];

bool cmp( node a,node b )
{
    return a.rate>b.rate;
}

int main()
{
    int n,i;
    double m,sum;
    while( scanf( "%lf%d",&m,&n ) && !( m==-1 && n==-1 ) )
    {
        memset( trade,0,sizeof(trade) );
        for( i=0;i<n;i++ )
        {
            scanf( "%lf%lf",&trade[i].j,&trade[i].f );
            trade[i].rate=trade[i].j/trade[i].f;
        }
        sort( trade,trade+n,cmp );
        sum=0;
        for( i=0;i<n;i++ )
        {
            if( m<=0 )  break;
            if( m>=trade[i].f )
            {
                m-=trade[i].f;
                sum+=trade[i].j;
            }
            else
            {
                sum+=trade[i].rate*m;
                break;
            }
        }
        printf( "%.3lf\n",sum );
    }
    return 0;
}