// test pages 368--369:  note that heaps are reorganised other containers
#include <vector>
#include <algorithm>
#include <iostream>
#include "random.cpp"

int main()
{
	vector<int> v;
	Random r(0,999);//produces random doubles in 0..999
	int n;//for random numbers
	for(int i=0; i<10; i++)
	{	n=r();
		cout << n << endl;
		v.push_back(n);
	}
	cout << "--------------"<<endl;
	make_heap(v.begin(), v.end());
	sort_heap(v.begin(), v.end());
	cout << "--------------"<<endl;

	for(int i=0; i<v.size(); i++)
	{
		cout << v[i]<<endl;
	}
}