#define USECHRONO
#undef HAVE_MPI

#include "eval.hpp"
#include <cassert>
#include <climits>
#include <cstdlib>
#include <stack>
#include <list>
#include <set>
using namespace aed;
using namespace std;


//---:---<*>---:---<*>- COMIENZA CODIGO FUNCION --:---<*>---:---<*>---:---<*>
// COMPLETAR DNI y NOMBRE AQUI:
// Nombre: Zeballos Bruno
int DNI=43114431;

int promedio(set<int>K){
  int sum = 0;
  auto it = K.begin();
  while(it!=K.end()){
    sum += *it;
    it++;
  }
  return sum / K.size();
}
  
 void subk(set<int> &S, int k, set<int> C, set<int>::iterator itS, list<set<int>> &LK) 
 {
   if (itS == S.end()) return;
   if (k == 0) { LK.insert(LK.begin(),C); return;}
   
   //almacena set actual
   set<int> D = C;	
   
   //agrego *itS a C 
   C.insert(C.end(), *itS);						
   itS++;							
   
   // se agrega C a la lista si C.size = k
   if (C.size() == k)
     LK.insert(LK.end(),C);	
   
   //bifurcaci?n: 		
   //Rama 1: agregando 
   subk(S,k,C,itS,LK);		
   
   //Rama 2: no agregando
   subk(S,k,D,itS,LK);							
   
 }
 
 
 list<set<int>> subk(set<int> &S) {	
   set<int> C;
   C.clear();
   
   list<set<int>> LK;		
   set<int>::iterator itS = S.begin();	
   for(int k=0;k<S.size();k++) {  
   subk(S,k,C,itS,LK);	
   }
   return LK;	
 } 
 
void get_largest_subset(set<int> &S, set<int> &C)
{
  //COMPLETAR!
  if(S.empty()) return;
  set<int>mayor;
  int promedioS = promedio(S);
  list<set<int>> subconjuntos = subk(S);
  for(auto X : subconjuntos){
    if(promedio(X)  promedioS){
      mayor = X;
    }
  }
  
}


//---:---<*>---:---<*>- FINALIZA CODIGO FUNCION --:---<*>---:---<*>---:---<*>
int main() {
  Eval ev;
  int vrbs=0;
  ev.eval<1>(get_largest_subset,vrbs);
  
  return 0;
}