#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: Valentin Pereira
int DNI=42994396;

int get_prom(set<int> S){
  int prom, suma=0;
  auto it = S.begin();
  while(it!=S.end()){
    suma += *it;
    it++;
  }
  prom = suma / S.size();
  return prom;
}
set<int> relacion_orden(set<int> A, set<int> B){
  int j=0;
  auto itA= A.begin();
  auto itB= B.begin();
  set<int> real;
  while(){
    if(itA!=A.end() && itB==B.end()) real = A;
    if(itA==A.end() && itB!=B.end()) real = B;
    if(max(A)>max(B))real = A;
    if(max(A)<max(B))real = B;
    itA++;itB++;
  }
  return real;
}
void get_largest_subset(set<int> &S, set<int> &C)
{
  //COMPLETAR!
  int promS = get_prom(S);
  list<set<int>> subconj, special;
  subconj=subl(S);
  auto it =subconj.begin();
  int distanciamin = 99999;
  while(it!=subconj.end()){
    set<int> c = *it;
    if(abs(get_prom(c))<=distanciamin){
      special.push_back(c);
    }
  }
  auto it2 = special.begin();
  set<int> aux = *it2;
  while(it2!=special.end()){
    C=relacion_orden(aux,*it2);
    it2++;
  }
  
}


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