9Gt6G3 - Online C++0x Compiler & Debugging Tool

#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
inline int power(int a, int b) {
    int x = 1;
    while (b) {
        if (b & 1) x *= a;
        a *= a;
        b >>= 1;
    }
    return x;
}


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

//_ ***************************** START Below *******************************


vector<vector<int>> a;


int count(int m, int mid ){
    int ct = 0;
    for(int i=0; i<m; i++){
        int j = upper_bound(begin(a[i]), end(a[i]), mid) - begin(a[i]);
        ct += j;
    }
    return ct;
}


//* Median of matrix sorted row wise

void consistency1(int m, int n) {

	int k = m*n/2;

	int s = 1, e = 1e9;

	int ans = INT32_MAX;
	while(s<=e){
	    int mid = s + (e-s)/2;

	    int ct = count(m, mid);
	    if(ct > k ){
	    	ans = min(ans, mid);
	        e = mid-1;
	    }
	    else{
	        s = mid+1;
	    }
	}

	cout << ans << " ";

}


//* Median of matrix (sorted row wise)

//* Lock BS
//*   [  2   2   2   3   3   4   4   4   ]
//*      F   F   F   T   T   T   T   T


void consistency2(int m, int n) {

	int k = m*n/2;

	int s = 1, e = 1e9;

	while(s<e){
	    int mid = s + (e-s)/2;

	    if(count(m, mid) > k ){
	        e = mid;
	    }
	    else{
	        s = mid+1;
	    }
	}

	cout << s << " ";

}


void solve() {

	int m, n;
	cin >> m >> n;

	a.resize(m, vector<int>(n));

	for(int i=0; i<m; i++)
		for(int j=0; j<n; j++) cin >> a[i][j];


    consistency1(m, n);
    consistency2(m, n);
    cout << endl;

}


int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}