Want to fly participates to ny and sf offices. each office can only accomodate half. goal is to assign each participate to an office in a way that the total travel cost for the company is minimized. each participant is represented as pair of costs <costofNYFlight, costofSFFlight>. determine the min cost given a list of participants.
Sample input:
<500,600><600,400><200,900><700,300>
output:
1400 (200+500+400+300)
给你一堆人从纽约飞各个地方开会的 cost
比如
A 去 城市SF, LA的 cost 分别是 200, 300
B 去城市SF, LA的 cost 分别是 200, 400
C 去城市SF, LA的 cost 分别是 100, 400
D 去城市SF, LA的 cost 分别是 320, 210
然后保证一半的人去 SF，一半的人去 LA
使得总的 cost 最小