There are 2 sets of countries. One set will donate clothes (something of this sort) and anotherset will accept clothes. A country can be in only 1 of the sets. The amount of clothes donated is also given. The problem is to maximize this amount of clothes. Condition: One­to­One relationship must be there between countries in different sets. Test Cases are like this: {4,4,5,{1,3,7},{1,2,6},{2,1,5},{3,4,6},{4,2,4}} {r1,r2,tc,{c1,c2,a},….} r1 = no. of countries in set1 r2 = no. of countries in set2 tc = no. of test­cases ­ followed by that no.of test­cases {c1,c2,a} = c1 country is giving ‘a’ amount of clothes to c2 country. Maximize the total amount donated, following the condition that one country can donate to only one country and one country can accept from only one country