HDU2187

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
struct price{
    int p;
    int h;
}t[1001];
bool cmp(struct price a,struct price b){
    if (a.p<b.p)
        return true;
    else
        return false;
}

int main()
{
    int C;
    cin>>C;
    double sum=0,tem;
    while(C--){
        int n,m,i;
        cin>>n>>m;
        for (i=0; i<m; i++)
            scanf("%d%d",&t[i].p,&t[i].h);

        sort(t,t+m,cmp);
        for (i=0; i<m; i++){
            tem = t[i].p*t[i].h;
            if (tem<=n){
                sum = t[i].h + sum;
                n = n - tem;
            }
            else{
                sum = double(n)/t[i].p + sum;
                break;
            }
        }
        printf("%.2lf\n",sum);
        sum = 0;
        }

    return 0;
}