Two greedy algorithms to the problem of choose a headquarters of two , each headquarters had their costs and a cost of changed of headquarters. One algorithm have a selection function with the cost of change an the other without that cost.

3º. Obligatoria