Submission #1780748

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
#define pq priotity_queue
#define P pair<int,int>
#define P2 pair<int,P>
#define P3 pair<int,P2>
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,-1,0,-1,1,0,0};
const ll LINF=1e18;
const ld PI=abs(acos(-1));
ll n,m,a,b;
vector<pair<ll,ll>> vec;

int main(){
	cin >> n >> m;
	REP(i,0,n) cin >> a >> b, vec.push_back(make_pair(a,b));
	
	REP(i,0,n){
		REP(j,0,n){
			vec.push_back(make_pair(vec[i].first, vec[j].second));
			vec.push_back(make_pair(vec[j].first, vec[i].second));
		}
	}
	
	ll mi=0;
	REP(i,0,vec.size()){
		REP(j,i+1,vec.size()){
			ll rx=max(vec[i].first, vec[j].first);
			ll ry=max(vec[i].second, vec[j].second);
			ll lx=min(vec[i].first, vec[j].first);
			ll ly=min(vec[i].second, vec[j].second);
			
			int c=0;
			REP(k,0,n) if((lx<=vec[k].first and vec[k].first<=rx) and (ly<=vec[k].second and vec[k].second<=ry)) c++;
			if(c>=m and !mi) mi=(ll)(rx-lx)*(ll)(ry-ly);
			if(c>=m) mi=min(mi, (ll)(rx-lx)*(ll)(ry-ly));
		}
	}
	
	cout << mi << endl;
	return 0;
}

Submission Info

Judge Result