Submission #1496793

---

Source Code Expand

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>
#include<iterator>

#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, char> plc;

int a, b, c, d;
int e[11][11];

bool check(int n) {
	int pass_p = 0;
	for (int i = 0; i < c; i++) {
		int pass = 0;
		for (int j = 0; j < a; j++) {
			if (e[i][j] >= n)pass++;
		}
		if (pass >= b)pass_p++;
	}
	return pass_p >= d;
}

int main()
{
	cin >> a >> b >> c >> d;
	for (int i = 0; i < c; i++) {
		for (int j = 0; j < a; j++) 
			cin >> e[i][j];
	}

	int low = 0, high = 100, mid;
	while (high-low > 1) {
		mid = (low + high) / 2;
		if (check(mid))low = mid;
		else high = mid;
	}
	cout << low << endl;
	return	0; 
}

Submission Info

Judge Result