P1208 [USACO1.3]混合牛奶 Mixing Milk

#include <iostream>
#include <algorithm>
#include <string.h>
#include <functional>
using namespace std;
struct former{
	int pr;
	int nu;
	
}a[2222222];
bool cmp(former d,former b){
	return d.pr<b.pr;
}
int main()
{
  long long n,m,i;
  cin>>n>>m;
  for(i=1;i<=m;i++)
  {
  	cin>>a[i].pr>>a[i].nu;
  }
  sort(a+1,a+n+1,cmp);//这里是a+n+1，是n！！！！！
  int price=0;
    while(1)
  {
  	if(n>a[i].nu)
  	{
  		price+=a[i].pr*a[i].nu;
  		n-=a[i].nu;
	}
    else
    {
    	price+=a[i].pr*n;
    	break;
	}
	i++;
  }
  cout<<price<<endl;
    return 0;
}