#include <vector>
#include <iostream>
#include <string>
#include <iterator>
#include <algorithm>
#include <iterator>
using namespace std;
//myAlgo_stable_sort1.cpp
int deviation( int );
static  int total1; 
int mean ; 
int Compare( int ,int  );
int main()
{
	int n1[10] = { 69 ,75,63,61,65,64,68,64,71,70  };
	vector<int>v1( n1, n1+10), v2;
	vector<int>::iterator it; 
	ostream_iterator< int > output( cout, " " );
	cout<<"\n orignal array \n\t"; 
	cout <<"\n ------Using vector :------\n "; 
	   for(it= v1.begin(); it !=v1.end(); it++)
	     {
	    	 cout <<" "<< *it; 
	    	 total1 = total1 + *it; 
	    } 
		 mean = total1/10; 
		  cout<<"\n---------------";
		cout<<"\n mean of elements : "<<mean; 
		 cout<<"\n---------------"; 
		 stable_partition(v1.begin(), v1.end(),deviation);
	     cout<<"\n partioned after : "<< mean <<"\n\t \b"; 
	 	 copy(v1.begin(), v1.end(), output);	
		 cout<<"\n print only the higher values \n\t";
		for(it=v1.begin(); it !=v1.end(); it++)
		{
		if(*it >mean){ cout<< " "<< *it;}
		} 
		//
		cout<<"\n---------------"; 
		 stable_sort(v1.begin(), v1.end(),Compare);
	     cout<<"\n stable_sort after : "<<"\n\t \b"; 
		 copy(v1.begin(), v1.end(), output);
   return 0;
}


int deviation( int value )
{
	return value>mean ;
}
int Compare( int value1,int value2 )
{	 
	return value1>value2 ;
}