AtCoder Beginner Contest 075 D

AtCoder Beginner Contest 075 D - Axis-Parallel Rectangle

我要崩溃，当时还以为是需要什么离散化的，原来是暴力，特么五层循环。。。。我自己写怎么都错。。。。。暴力都不会了，，，，，

#include<iostream>
#include<vector>
#include<limits>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn = 105;
int N, K;

int main()
{
    cin >> N >> K;
    ll x[maxn], y[maxn], a[maxn], b[maxn];
    for (int i = 0; i<N; i++) {
        cin >> a[i] >> b[i];
        x[i] = a[i], y[i] = b[i];
    }
    sort(x, x + N);
    sort(y, y + N);
    ll ans = 1ll << 62;
    for (int i = 0; i < N; i++) {
        for(int j=i+1;j<N;j++)
            for (int k = 0; k < N; k++) {
                for (int l = k + 1; l < N; l++) {
                    ll sx = x[i];
                    ll gx = x[j];
                    ll sy = y[k];
                    ll gy = y[l];
                    int cnt = 0;
                    for (int m = 0; m < N; m++) {
                        if (a[m] >= sx&&a[m] <= gx&&b[m] >= sy&&b[m] <= gy)
                            cnt++;
                    }
                    if (cnt >= K)
                        ans = min(ans, (gx - sx)*(gy - sy));
                }
            }
    }
    cout << ans << endl;
    return 0;
}