#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: Bob Esponja
int DNI=98765432;

float dis_prom(set<int> &S, float p){
  float promS = 0;
  for( set<int>::iterator it=S.begin(); it!=S.end(); ++it ) { 
    promS += float(*it)/S.size();
  }
  return abs(p-promS);	
}
  
  
bool es_mayor(set<int> A, set<int> B){
  set<int>::iterator itA = A.begin(), itB=B.begin();
  if (itA != A.end() && itB == B.end()) return true;
  
  int maxA = 0,maxB=0;	
  for( set<int>::iterator it=A.begin(); it!=A.end(); ++it ) { 
    if (*it > maxA) maxA = *it;
  }
  for( set<int>::iterator it=B.begin(); it!=B.end(); ++it ) { 
    if (*it > maxB) maxB = *it;
  }
  
  if (maxA > maxB) return true;
  else if (maxA < maxB) return false;
  else if (maxA = maxB){
    A.erase(maxA);
    B.erase(maxB);
    return es_mayor(A,B);
  }
}
  
void calc_sub_propio(set<int> &S, set<set<int>> &SubPropios){
  SubPropios.clear();
  set<int>::iterator itS = S.begin();
  int N = S.size();
  N--;
  while (itS != S.end()){
    set<int> temp;
    temp.clear();
    temp.insert(*itS);
    SubPropios.insert(temp);
    
    
    set<int>::iterator itS2 = S.begin();
    while (itS2 != S.end() && temp.size() != N){
      temp.insert(*itS2);
      if (SubPropios.find(temp) == SubPropios.end()){
        SubPropios.insert(temp);
      } else {
        temp.clear();
      }
      itS2++;
    }
    itS++;	
  }
}
  
void get_largest_subset(set<int> &S,set<int> &C){
  C.clear();
  if (S.empty()) return;
  float prom = 0;
  for( set<int>::iterator it=S.begin(); it!=S.end(); ++it ) { 
    prom += float(*it)/S.size();
  }
  float dmin = 100000;
  set<set<int>> SP;
  calc_sub_propio(S,SP);
  
  set<set<int>>::iterator itSub = SP.begin();
  
  while (itSub != SP.end()){
    set<int> temp = *itSub;
    float d = dis_prom(temp,prom);
    if (d < dmin){
      dmin = d;
      C = temp;
    } else if (d == dmin && es_mayor(temp,C)){
      C = temp;
    }
    itSub++;
  }
  
}


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