#define USECHRONO
#undef HAVE_MPI

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


//---:---<*>---:---<*>- COMIENZA CODIGO FUNCION --:---<*>---:---<*>---:---<*>
// COMPLETAR DNI y NOMBRE AQUI:
// Nombre: Felipe Repetto
int DNI=39950635;

float promedio(set<int> S)
{
  set<int>::iterator itS = S.begin();
  float acum = 0;
  while(itS != S.end())
  {
    acum += *itS;
    itS++;
  }
  return acum/S.size();
}

set<int> mayor(set<int> &S, set<int> &C)
{
  set<int>::iterator itS = S.begin(), itC = C.begin();
  
  while(itS != S.end())
  {
    if(itC == C.end() || *itS > *itC)
      return S;
    itS++;
    itC++;
  }
  
  return C;
}

void get_largest_subset(vector<set<int>> &VS, set<int> &C, promS)
{
  
  
  //Ir sacando el mayor que tenga el promedio mas cercano a promS y guardarlo en C.
}

void get_largest_subset(set<int> &S, set<int> &C)
{
  set<set<int>> SsubS;
  set<int>::iterator itS = S.begin(), itS_aux = ++S.begin();
  set<int> subS;
  
  while(itS != S.end())
  {
    subS.insert(*itS);
    SsubS.insert(subS);
    
    while(itS_aux != S.end())
    {
      subS.insert(*itS_aux);
      SsubS.insert(subS);
      itS++;
    }
    
    for(int i=0;i<S.size();i++, itS_aux++)
    {
      subS.insert(*itS_aux);
      SsubS.push_back(subS);
    }
  }
  
  get_largest_subset(VS, C, promedio(S));
}

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