A company is planning to interview `2n` people. Given the array `costs` where `costs[i] = [aCost_i, bCost_i]`, the cost of flying the `i`th person to city `a` is `aCost_i`, and the cost of flying the `i`th person to city `b` is `bCost_i`.
Return the minimum cost to fly every person to a city such that exactly `n` people arrive in each city.
### Constraints
- `2 <= costs.length <= 100`
- `costs.length` is even.
- `1 <= aCost_i, bCost_i <= 1000`
### Input Format
- Line 1: An integer `m` (where `m = 2n`) representing the number of people.
- Next `m` lines: Two space-separated integers `aCost bCost`.
### Output Format
Print the minimum total travel cost.