#include<iostream.h>
#include<fstream.h>
#include<apvector.h>
#include<iomanip.h>

struct InfoType
{
	int id;
	int inv;
};

struct StoreType
{
	apvector<InfoType> vect;
	int Number;
};
//===========================================================
void quickSort (apvector<InfoType> &list, int first, int last);
 void swap(int a, int b, apvector<InfoType> &vect)
{
  apvector<InfoType> temp(2);

  temp[1] = vect[a];
  vect[a] = vect[b];
  vect[a] = temp[1];
}

 void search();
 //=======================================================
void main()
{
InfoType Info;
StoreType List;
int j=0;
int first=0;
int last=19;
//------------------------------------
ifstream infile ("C:\\FILE50.txt",ios::in);
		if (infile.fail())  cerr<<"did not open corectly"<<endl;
	infile>>List.Number;
List.vect.resize(List.Number);

for(int loop=0;loop<List.Number; loop++)
	{
	infile>>List.vect[loop].id;
		infile>>List.vect[loop].inv;
	}
//----------------------------------


quickSort(List.vect,first,last);
	  while(j<List.Number)
		{
		cout<<setw(1)<<j;
		cout<<setw(10)<<List.vect[j].id<<setw(15);
		cout<<List.vect[j].inv<<endl;
		
		switch(j)
			{
				case 10: cout<<endl; break;
				case 20: cout<<endl; break;
				case 30: cout<<endl; break;
				case 40: cout<<endl; break;
				default: break;
				}
		 j++;
		 }
search();

}

void quickSort (apvector<InfoType> &list, int first, int last)
 {
	int g = first, h = last;
	int midIndex, dividingValue, temp;

	midIndex = (first + last) / 2;
	dividingValue = list[midIndex].id;
	do
	{
		while (list[g].id < dividingValue) g++;
		while (list[h].id > dividingValue) h--;
		if (g <= h)
		{



			swap(g, h, list);
			g++;
			h--;
		}
	}
	while (g < h);
	if (h > first) quickSort (list,first,h);
	if (g < last) quickSort (list,g,last);
}


 void search()
 {
	 int prodid;

	 cout<<"what is the ID of the item you are looking for";
	 cin>>prodid;

		for(int loop=0; loop<20; loop++)
			{
				if(List.vect[loop].id==prodid)
					{
						cout<<"there are "<<List.vect[loop].inv<<" in stock";
						break;
					}
				}
	 }