Submission #2549233

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = (A); I < (B); ++I)
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin()) //ai>=v  x is sorted
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin()) //ai>v  x is sorted
#define NUM(x,v) (POSU(x,v)-POSL(x,v))  //x is sorted
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define REV(x) (reverse(x.begin(),x.end())) //reverse
#define TO(x,t,f) ((x)?(t):(f))
#define CLR(mat) memset(mat, 0, sizeof(mat))
#define FILV(x,a) fill(x.begin(),x.end(),a)
#define FILA(ar,N,a) fill(ar,ar+N,a)
#define NEXTP(x) next_permutation(x.begin(),x.end())
ll gcd(ll a,ll b){if(a<b)swap(a,b);if(a%b==0)return b;else return gcd(b,a%b);}
ll lcm(ll a,ll b){ll c=gcd(a,b);return ((a/c)*(b/c)*c);}//saisyo kobaisu
#define pb push_back
#define pri(aa) cout<<(aa)<<endl
#define mp(x,y) make_pair(x,y)
#define fi first
#define se second
const ll INF=1e9+7;
const ll N = 200002;
struct syo{ll s1,s2,s3,s4;};
ll n,k;
vector<P> p;
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin>>n>>k;
	ll XR=-1e9,XS=1e9,YR=-1e9,YS=1e9;
	FOR(i,0,n){
		ll x,y;
		cin>>x>>y;
		if(x<XS)XS=x;
		if(x>XR)XR=x;
		if(y<YS)YS=y;
		if(y>YR)YR=y;
		p.pb(mp(x,y));
	}
	SORT(p);
	ll ans=(XR-XS)*(YR-YS);
	FOR(i,0,n){
		FOR(j,0,n){
			FOR(a,0,n){
				FOR(b,0,n){
					ll xs,xr,yr,ys,ko=0;
					xs=p[i].fi;
					xr=p[j].fi;
					ys=p[a].se;
					yr=p[b].se;
					if(xs>xr || ys>yr)continue;
					FOR(o,0,p.size()){
						if(p[o].fi<=xr&&p[o].fi>=xs&&p[o].se>=ys&&p[o].se<=yr)ko++;
					}
					if(ko>=k)ans=min(ans,(xr-xs)*(yr-ys));
				}
			}
		}
	}
	pri(ans);
	return 0;
}

Submission Info

Judge Result