### Problem Statement

Create a class ContractWork containing a method minimumCost which takes a String[] costs and an int numTasks as input. Each element of costs is a string of numbers separated by exactly one space. The jth number in element i of costs represents the amount company i will charge to perform task j. Each string will contain exactly numTasks numbers. Clearly, the number of companies is the number of elements in costs. The method should return an int corresponding to the minimum cost incurred by your company while contracting out the tasks.

### Definition

 Class: ContractWork Method: minimumCost Parameters: String[], int Returns: int Method signature: int minimumCost(String[] costs, int numTasks) (be sure your method is public)

### Constraints

-costs will contain between 2 and 50 elements inclusive.
-numTasks will be between 2 and 50 inclusive.
-Each element of costs will contain exactly numTasks numbers, each separated by single spaces.
-Each number in costs will be an integer between 0 and 100, inclusive with no extra leading zeroes.
-Each element of costs will contain between 1 and 50 characters, inclusive.

### Examples

0)

 `{"1 2 3", "4 5 6"}` `3`
`Returns: 9`
 There are three ways to achieve the best answer. Company 0 can perform tasks 0 and 1 with Company 1 performing task 2, or, Company 1 can perform task 0 with Company 0 performing tasks 1 and 2, or finally, Company 0 can perform tasks 0 and 2, with Company 1 performing task 1. Any other combination gives a higher cost to your company.
1)

 `{"1 1 1 1", "1 1 1 1", "1 1 1 1"}` `4`
`Returns: 4`
2)

 `{"12 14 4 11 0 35", "44 41 1 1 0 15", "35 1 35 55 1 13", "0 0 0 0 0 0"}` `6`
`Returns: 1`
3)

 ```{"44 92 2 78 13", "36 47 76 41 71", "59 27 59 35 16", "40 63 7 72 76", "49 80 45 67 33"}``` `5`
`Returns: 113`

#### Problem url:

http://www.topcoder.com/stat?c=problem_statement&pm=3525

#### Problem stats url:

http://www.topcoder.com/tc?module=ProblemDetail&rd=7223&pm=3525

NeverMore

#### Testers:

PabloGilberto , lbackstrom , brett1479

#### Problem categories:

Dynamic Programming