spoj 274

离散化   枚举行  扫描横坐标

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define inf 0x7fffffff
using namespace std;

struct cc
{
    int x,y,val;
};
cc pp[1010];
int k,line[1010],x[1010],cur;
int _max,_min;

int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n;
        scanf("%d%d",&n,&k);
        _max = -1;
        _min = inf;
        for(int i = 0; i < n; i++)
        {
            scanf("%d%d%d",&pp[i].x,&pp[i].y,&pp[i].val);
            line[i] = pp[i].y;
            _max = max(pp[i].x, _max);
            _min = min(pp[i].x, _min);
        }
        sort(line, line+n);
        int q = unique(line, line+n) - line;
//        if(q == 1)
//        {
//            puts("0");
//            continue;
//        }
        int ans = inf;
        for(int i = 0; i < q; i++)
        {
            for(int j = i; j < q; j++)
            {
                memset(x, 0, sizeof(x));
                for(int v = 0; v < n; v++)
                {
                    if(pp[v].y >= line[i] && pp[v].y <= line[j])
                        x[pp[v].x] += pp[v].val;
                }
                int l,r;
                l = r = _min;
                cur = x[_min];
                while(r <= _max)
                {
                    if(cur >= k)
                    {
                        ans = min(ans, (line[j]-line[i])*(r-l));
                        cur -= x[l++];
                    }
                    else
                    {
                        cur += x[++r];
                    }
                }
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}