#include <iostream.h>
#include <conio.h>

int G[30],C[30] ,n, i, s, Sg=0;

void Sort(int k, int x[20], int y[20])
{
	int max;


	for(i=1;i<=k-1;i++)
		if(x[i]<x[i+1])
		{
			max=x[i];
			x[i]=x[i+1];
			x[i+1]=max;
			max=y[i];
			y[i]=y[i+1];
			y[i+1]=max;
		}


}
main()
{

	cout<<"s="; cin>>s;
	cout<<"N="; cin>>n;

	for(i=1;i<n;i++)
	{
		cout<<"Obiect de greutate:";
		cin>>G[i];
		cout<<" si castig";
		cin>>C[i];
	}


	Sort(n,G,C);

	i=1;
	 int j=1;
	while(s)
	{
		if(s/C[i])
		{
			 Sg=0;

			cout<<s/C[i]<<"obiecte de castig "<<C[i];
			  while (j<s/C[i])
				 {Sg +=G[j];
					 j++;   }
                cout<<"greutate"<<Sg<<endl;
			s-=s/C[i]*C[i];
		}

	i++;

	}

	getch();
}