简单题->hdu 3626 For

For

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  HDU 3626

Description

LMY is a mathematics lover. Now LMY likes to play matrix. LMY designs such a matrix problem. In a large matrix, there are some elements has been marked. For every marked element, return a marked element whose row and column are larger than the original marked element’s row and column respectively. If there are multiple solutions, return the element whose row is the smallest; and if there are still multiple solutions, return the element whose column is the smallest. If there is no solution, return -1 -1.
Of course LMY wants YY also like matrix. So she lets YY develop a program to solve the problem. But YY is very busy now. He should learn English for his enrollment examination for Ph.D. students. Could you help YY develop the program?

 

Input

The input consists of multiple test cases. For each test case, the first line contains only one integer n. n ≤ 1000. Each of the next n lines describes a marked element’s row and column. A marked element’s row and column can be repeatedly showed. There is a blank line between two consecutive test cases.
End of input is indicated by a line containing a zero.

 

Output

Start each test case with "Case #:" on a single line, where # is the case number starting from 1. For each element’s row and column, output the result. The format is showed as sample output. There is a blank line between two consecutive test cases.

 

Sample Input

     
     

      
      5
1 8
5 7
6 9
2 8
3 1

10
7 5
7 5
3 1
9 9
1 4
7 4
2 3
9 5
4 5
3 4

0
     
     

 

Sample Output

     
     

      
      Case 1:
6 9
6 9
-1 -1
6 9
5 7

Case 2:
9 9
9 9
4 5
-1 -1
4 5
9 5
3 4
-1 -1
9 9
4 5
     
     
     
     


     
     
     
     

      
      
#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;

#define MAXN 1000 + 10

struct Node
{
    int x, y, id;
    int ansx, ansy;
}temp[MAXN];

int n, k;

bool cmp(Node a, Node b)
{
    if (a.x < b.x)
    {
        return true;
    }
    else if (a.x == b.x && a.y < b.y)
    {
        return true;
    }

    return false;
}

bool cmp2(Node a, Node b)
{
    return a.id < b.id;
}

void solve()
{
    sort(temp, temp + n, cmp);

    for (int i = 0; i < n; i++)
    {
        int u = -1;

        for (int j = i + 1; j < n; j++)
        {
            if (temp[j].x > temp[i].x)
            {
                u = j;
                break;
            }
        }

        if (u != -1)
        {
            for (int j = u; j < n; j++)
            {
                if (temp[j].y > temp[i].y)
                {
                    temp[i].ansx = temp[j].x;
                    temp[i].ansy = temp[j].y;
                    break;
                }
            }
        }
    }

    sort(temp, temp + n, cmp2);

    cout << "Case " << ++k << ":" << endl;

    for (int i = 0; i < n; i++)
    {
        printf("%d %d\n", temp[i].ansx, temp[i].ansy);
    }
}

void input()
{
    int ff = 0;
    while(scanf("%d", &n) != EOF)
    {
        if (n == 0)
        {
            break;
        }
        if(ff != 0)
        {
            printf("\n");
        }
        ff = 1;

        for (int i = 0; i < n; i++)
        {
            scanf("%d %d", &temp[i].x, &temp[i].y);
            temp[i].id = i;
            temp[i].ansx = temp[i].ansy = -1;
        }

        solve();
    }


}

int main()
{
    input();
    return 0;
}