//1. Class ME_mutation: save ME_mutations with top(minimum) weight, i.e. solution cover more tumors and with smaller weight.
#include <stdio.h>
#include <iostream>
#include <sstream>
#include <stdlib.h>

#include <fstream>
#include <set>
#include <iterator>
#include <map>
#include <string>
#include <time.h>
#include <math.h>
#include <list>
using namespace std;

class ME_mutation
{
	public:
		int mutation[maxGraphSize];
		double weight;
		int size;
		int coverNo;

		ME_mutation(const ME_mutation& p);
		ME_mutation();
		ME_mutation(int p_ver,double p_weight,int p_cover);
		void clear();
		void addMutation(int p_ver,double p_weight,int p_cover);
		void addMutation(const ME_mutation& p);
		void print();


};

ME_mutation::ME_mutation(const ME_mutation& p)
{
	for (int i=0; i<p.size; i++)
	{
		mutation[i] = p.mutation[i];
	}
	weight = p.weight;
	size = p.size;
	coverNo = p.coverNo;
}

ME_mutation::ME_mutation()
{
	for (int i=0; i<maxGraphSize; i++)
	{
		mutation[i] = -1;
	}
	weight = 0;
	size = 0;
	coverNo = 0;
}

ME_mutation::ME_mutation(int p_ver,double p_weight,int p_cover)
{
	mutation[0] = p_ver;
	weight = p_weight;
	size = 1;
	coverNo = p_cover;
}

void ME_mutation::clear()
{
	weight = 0;
	size = 0;
	coverNo = 0;
}

void ME_mutation::addMutation(int p_ver,double p_weight,int p_cover)
{
	mutation[size] = p_ver;
	weight += p_weight;
	size += 1;
	coverNo += p_cover;
}

void ME_mutation::addMutation(const ME_mutation& p)
{
	for (int i=0; i<p.size; i++)
	{
		mutation[size+i] = p.mutation[i];
	}
	weight += p.weight;
	size += p.size;
	coverNo += p.coverNo;
}

void ME_mutation::print()
{
	cout<<"Mutation: ";
	for (int i=0; i<size; i++)
	{
		cout<<mutation[i]<<"; ";
	}
	cout<<"\nWeight: "<<weight;
	cout<<"\nSize: "<<size;
	cout<<"\nCoverNo: "<<coverNo<<"\n\n";
}

bool operator< (const ME_mutation &c1, const ME_mutation &c2)
{
	//the minimum solution covers more tumors, or has smaller weight (if cover the same number of tumors),
	// or has fewer mutatins (if cover the same number of tumors and has the same weight). 
	if (c1.coverNo>c2.coverNo)
	{
		return 1;
	}
	else
	{
		if (c1.coverNo==c2.coverNo)
		{
			if (c1.weight<c2.weight)
			{
				return 1;
			}
			else
			{
				if (c1.weight==c2.weight && c1.size<c2.size)
				{
					return 1;
				}
			}
		}
	}
	return 0;
}