Submission #1793663

---

Source Code Expand

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cctype>
#include<iostream>
#include<stack>
#include<string>
#include<vector>
#include<queue>
#include<deque>
#include<algorithm>
#include<utility>
#include <map>
#include <set>

using namespace std;

#define REP(i,x) for(int i=0; i<(int)(x); i++)       // 0 <= i < x
#define REPS(i,x) for(int i=1; i<=(int)(x); i++)     // 0 < i <= x
#define RREP(i,x) for(int i=((int)(x)-1); i>=0; i--) // x > i >= 0
#define RREPS(i,x) for(int i=((int)(x)); i>0; i--)   // x >= i > 0
#define INF 100000000

typedef long long ll;
typedef pair<int, int> P;

int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};

int N, K;
int x[50], y[50];

int main(void){
	cin >> N >> K;
    REP(i, N){
        cin >> x[i] >> y[i];
    }

    ll res = 4E+18;
    REP(i, N){
        REP(j, N){
            REP(k, N){
                REP(l, N){
                    ll left = min(x[i], x[j]);
                    ll right = max(x[i], x[j]);
                    ll upper = max(y[k], y[l]);
                    ll lower = min(y[k], y[l]);
                    ll num = 0;
                    REP(n, N){
                        if(left<=x[n] && x[n]<=right && lower<=y[n] && y[n]<=upper){
                            num++;
                        }
                    }
                    if(num>=K){
                        res = min(res, (right-left) * (upper-lower));
                    }
                }
            }
        }
    }

    cout << res << endl;
    return 0;                     
}

Submission Info

Judge Result