|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|5 초||128 MB||10||5||5||50.000%|
You are M, the head of the intelligence agency which employs N spies with codenames from 1 to N.
Each of the spies has been assigned a different country and obtained an important piece of informationthere. Your task is the following:
Find the minimum total price of preparing and executing this assignment.
The first line of input contains the positive integer N, the number of spies (2 ≤ N ≤ 1000).
Each of the following N lines contains N positive integers not exceeding 106. The number in row k and column m represents the price of a meeting between spies k and m and, of course, equals the number in row m and column k (for k = m the number will be 0).
The following line contains N positive integers Mk (1 ≤ Mk ≤ 106), the prices of sending each spy on the assignment, in order for spies 1, 2, ..., N.
The first and only line of output must contain the required minimum total price.
3 0 6 9 6 0 4 9 4 0 7 7 7
We will organize meetings between spies 1 and 2, then 2 and 3, and send spy 2 on the assignment.