MOBIVINA  MobiZone vs VinaGone
English  Tiếng Việt 
KTuan and AnhDQ, CEOs of two telecommunication corporations MobiZone and VinaGone have signed a contract to use their network in common. N people have accepted to try this new service. The i^{th} people accepts to pay M_{i} to use MobiZone's service or V_{i} to use VinaGone's one; and any two people i^{th} and j^{th} accept to pay C_{ij} in common whether they use different services (the network cost).
Request
Find a way of choosing networks for N people satisfying the sum of total cost is minimum.
Input
 The first line contains number N.
 The second line contains N number(s) M_{i}.
 The third line contains N number(s) V_{i}.
 The last N line(s), each of them contains N number(s) C_{ij} (C_{ij} = C_{ji}).
Output
 Contains the minimum total cost.
Example
Input:
3
1 1 10
10 10 1
0 0 1
0 0 1
1 1 0
Output:
5
Limitations
 N ≤ 250.
 The remaining numbers of Input do not exceed 1000.
hide comments
যোবায়ের:
20130327 15:32:11
@Alex Abbas, I think the possible explanation is, you assign person1 with Mobi, person2 with Mobi and person3 with Vina. Then they need to pay 1 + 1 + 1 individually. Also, person1 and person3 are using different network, so they pay C[1][3] more, same as person2 and person3, C[2][3] more. totalling 3 + 1 + 1 = 5 Last edit: 20130919 05:40:15 

Alex Abbas:
20130226 15:28:06
I don't understand whether we need to connect all services to all people or just one service can u explain the input/output sample please... 

Ajey Golsangi:
20120830 16:56:31
The problem statement is unclear. Please rectify the grammar in the problem statement. 
Added by:  AnhDQ 
Date:  20090608 
Time limit:  0.100s0.25s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  Mr Tuan Khuc Anh  NTU (Singapore) 