/*
ID:18861501
LANG:C++
TASK:milk
*/
/*------------------Header Files------------------*/
#include <iostream>
#include <cstring>
#include <string>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <ctype.h>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <vector>
#include <limits.h>
using namespace std;
/*------------------Definitions-------------------*/
#define LL long long
#define PI acos(-1.0)
#define INF 0x3F3F3F3F
/*---------------------Work-----------------------*/
struct farmer
{
int money,amount;
}s[5050];
bool cmp(farmer a,farmer b)
{
return a.money<b.money;
}
void work()
{
int N,M;
scanf("%d%d",&N,&M);
for(int i=1;i<=M;i++)
scanf("%d%d",&s[i].money,&s[i].amount);
sort(s+1,s+M+1,cmp);
int sum=0;
for(int i=1;;i++)
{
if(N>s[i].amount)
{
sum=sum+s[i].amount*s[i].money;
N=N-s[i].amount;
}
else
{
sum=sum+s[i].money*N;
break;
}
}
printf("%d\n",sum);
}
/*------------------Main Function------------------*/
int main()
{
//freopen("test.txt","r",stdin);
freopen("milk.out","w",stdout);
freopen("milk.in","r",stdin);
work();
return 0;
}
1.3.1
最新推荐文章于 2023-09-08 16:27:55 发布