Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- using namespace std;
- int main() {
- int N;
- cin >> N;
- vector<vector<int>> graph(N, vector<int>(N));
- for (int i = 0; i < N; ++i) {
- for (int j = 0; j < N; ++j) {
- cin >> graph[i][j];
- }
- }
- vector<int> values(N);
- for (int i = 0; i < N; ++i) {
- cin >> values[i];
- }
- int min_weight = -1; // Инициализируем как -1, чтобы найти первый действительный вес
- int min_u = -1, min_v = -1;
- for (int i = 0; i < N; ++i) {
- for (int j = 0; j < N; ++j) {
- if (values[i] == 0 && values[j] == 1) {
- if (min_weight == -1 || graph[i][j] < min_weight) {
- min_weight = graph[i][j];
- min_u = i;
- min_v = j;
- }
- }
- }
- }
- cout << min_u + 1 << " " << min_v + 1 << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement
