https://leetcode.com/problems/two-city-scheduling\nWant 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.\n\n**Example:**\n```\nInput: [[500, 600], [600, 400], [200, 900], [700, 300]]\nOutput: 1400\nExplanation: 200 + 500 + 400 + 300\n```

https://leetcode.com/problems/two-city-scheduling\nWant to fly participates to NY and SF offices. Each office can only accomodate half. Goal is to assign each p