Submission #2548994

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<set>
#include<cmath>
#include<iomanip>
using namespace std;

int INF = 1e9 + 7;

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

int main() {
	int n, k;
	cin >> n >> k;
	vector<ll> x(n + 1), y(n + 1);
	for (int i = 1; i <= n; i++) cin >> x[i] >> y[i];

	sort(begin(x) + 1, end(x));
	sort(begin(y) + 1, end(y));

	int sum = 0;
	ll MIN = (x[n] - x[1])*(y[n] - y[1]);
	for (int xi = 1; xi <= n; xi++) {
		for (int xj = xi + 1; xj <= n; xj++) {
			for (int yi = 1; yi <= n; yi++) {
				for (int yj = yi + 1; yj <= n; yj++) {
					for (int i = 1; i <= n; i++) {
						if (x[xi] <= x[i] && x[i] <= x[xj] && y[yi] <= y[i] && y[i] <= y[yj]) {
							sum++;
						}
					}
					if (sum >= k) {
						MIN = min(MIN, (x[xj] - x[xi])*(y[yj] - y[yi]));
					}
					sum = 0;
				}
			}
		}
	}
	cout << MIN << endl;
}

Submission Info

Judge Result