Submission #2548827

---

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;

vector<ll> x(60), y(60);

int main() {
	int n, k;
	cin >> n >> k;
	for (int i = 1; i <= n; i++) cin >> x[i] >> y[i];
	
	int sum = 0;
	ll MIN = 9e18;
	for (int i = 1; i <= n; i++) {
		for (int j = i + 1; j <= n; j++) {
			for (int l = 1; l <= n; l++) {
				if (min(x[i], x[j]) <= x[l] && x[l] <= max(x[i], x[j]) && min(y[i], y[j]) <= y[l] && y[l] <= max(y[i], y[j])) {
					sum++;
				}
			}
			if (sum >= k) {
				MIN = min(MIN, ((max(x[i], x[j]) - min(x[i], x[j]))*(max(y[i], y[j]) - min(y[i], y[j]))));
			}
			sum = 0;
		}
	}
	cout << MIN << endl;
}

Submission Info

Judge Result