Submission #1928209

---

Source Code Expand

// {{{
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <numeric>
#include <utility>
#include <limits>
#include <time.h>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>

using namespace std;

typedef long int i32;
typedef unsigned long int u32;
typedef long long int i64;
typedef unsigned long long int  u64;
typedef pair<i32, i32> PII;
typedef vector<i32> VI;
typedef vector<string> VS;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef map<i32, i32> MPII;
typedef set<i32> SETI;
typedef multiset<i32> MSETI;
#define IN(x) cin >> x;
#define SCD(t) scanf("%d",&t)
#define SCLD(t) scanf("%ld",&t)
#define SCLLD(t) scanf("%lld",&t)
#define SCC(t) scanf("%c",&t)
#define SCS(t) scanf("%s",t)
#define SCF(t) scanf("%f",&t)
#define SCLF(t) scanf("%lf",&t)
#define MEM(a, b) memset(a, (b), sizeof(a))
#define ZERO(a) memset(a, 0, sizeof(a))
#define FOR(i, j, k, in) for (int i=j ; i<k ; i+=in)
#define RFOR(i, j, k, in) for (int i=j ; i>=k ; i-=in)
#define REP(i, j) FOR(i, 0, j, 1)
#define RREP(i, j) RFOR(i, j, 0, 1)
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define FOREACH(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define BTW(A, B, C) assert( B <= A && A <= C)
#define MP make_pair
#define PB push_back
#define PF push_front
#define INF (int)1e9
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define DEBUG(x) cout << #x << ": " << x << endl;

template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }
// }}}

int main() {
    int N, K;
    IN(N);IN(K);
    auto xys = vector<PII>(N);;
    REP(i, N) {
        IN(xys[i].first);IN(xys[i].second);
    }
    u64 ans = (u64)-1;
    REP(i, N)REP(j, N)REP(k, N)REP(l, N) {
        i32 x1, x2, y1, y2;
        x1 = x2 = xys[i].first;
        y1 = y2 = xys[i].second;
        amax(x1, xys[j].first);
        amax(x1, xys[k].first);
        amax(x1, xys[l].first);
        amin(x2, xys[j].first);
        amin(x2, xys[k].first);
        amin(x2, xys[l].first);
        amax(y1, xys[j].second);
        amax(y1, xys[k].second);
        amax(y1, xys[l].second);
        amin(y2, xys[j].second);
        amin(y2, xys[k].second);
        amin(y2, xys[l].second);
        u32 counter = 0;
        REP(m, N) {
            auto x = xys[m].first;
            auto y = xys[m].second;
            if((x1-x)*(x2-x) <= 0 && (y1-y)*(y2-y) <= 0) {
                counter++;
            }
        }
        if(counter >= K) {
            u64 area = (x1-x2) * (y1-y2);
            amin(ans, area);
        }
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result