hdu 3626 For（模拟）

题目链接：

http://acm.hdu.edu.cn/showproblem.php?pid=3626

解题思路：

暴力模拟即可。。。

AC代码：

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;

const int INF = 0x3f3f3f3f;
struct node{
    int x,y;
}no[1005];


int main(){
    int n,t = 1;
    while(scanf("%d",&n),n){
        if(t != 1)
            printf("\n");
        printf("Case %d:\n",t++);
        for(int i = 1; i <= n; i++)
            scanf("%d%d",&no[i].x,&no[i].y);
        int tmpx,tmpy;
        for(int i = 1; i <= n; i++){
            tmpx = INF;tmpy = INF;
            for(int j = 1; j <= n; j++){
                if(no[i].x<no[j].x && no[i].y<no[j].y){
                    if(no[j].x < tmpx){
                        tmpx = no[j].x;
                        tmpy = no[j].y;
                    }
                    else if(no[j].x == tmpx){
                        if(no[j].y < tmpy)
                            tmpy = no[j].y;
                    }
                }
            }
            if(tmpx == INF || tmpy == INF)
                printf("-1 -1\n");
            else
                printf("%d %d\n",tmpx,tmpy);
        }
    }
    return 0;
}