Submission #1625525

---

Source Code Expand

#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <cstdlib>
using namespace std;
#define Ma_PI 3.141592653589793
#define eps 0.00000000000000000000000001
#define LONG_INF 10000000000000000
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define REP(i,n) for(long long i = 0;i < n;++i)
#define seg_size 262144
int main() {
	int r, c, d;
	cin >> r >> c >> d;
	vector<tuple<int, int, int>> wow;
	REP(i, r) {
		REP(q, c) {
			int tmp;
			cin >> tmp;
			wow.push_back(make_tuple(tmp, i, q));
		}
	}
	sort(wow.begin(), wow.end(),greater<tuple<int,int,int>>());
	for (int i = 0;i < wow.size();++i) {
		if (get<1>(wow[i]) + get<2>(wow[i]) <= d) {
			int hogehoge = d - get<1>(wow[i]) - get<2>(wow[i]);
			if (hogehoge % 2 == 0) {
				cout << get<0>(wow[i]) << endl;
				return 0;
			}
		}
	}
}

Submission Info

Judge Result