putnik

#include <iostream>
#include <deque>
using namespace std;

void h(int i) {
	
}
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin >> n;
	int t[n][n];
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < n; ++j) {
			cin >> t[i][j];
		}
	}
	deque<int> d(1, 0);
	int sum = 0;
	for (int i = 1; i < n; ++i) {
		if (t[d.front()][i] < t[d.back()][i]) {
			sum += t[d.front()][i];
			d.push_front(i);
		} else {
			sum += t[d.back()][i];
			d.push_back(i);
		}
	}
	cout << sum;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER