【HDU】【3139】

Find the hotel

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 397    Accepted Submission(s): 103

Problem Description

  Summer again! Flynn is ready for another tour around. Since the tour would take three or more days, it is important to find a hotel that meets for a reasonable price and gets as near as possible! 
  But there are so many of them! Flynn gets tired to look for any. It’s your time now! Given the <p _i, d _i> for a hotel h _i, where p _i stands for the price and d _i is the distance from the destination of this tour, you are going to find those hotels, that either with a lower price or lower distance. Consider hotel h ₁, if there is a hotel h _i, with both lower price and lower distance, we would discard h1. To be more specific, you are going to find those hotels, where no other has both lower price and distance than it. And the comparison is strict.

 

Input

There are some cases. Process to the end of file.
Each case begin with N (1 <= N <= 10000), the number of the hotel.
The next N line gives the (p _i, d _i) for the i-th hotel.
The number will be  non-negative and less than 10000.

 

Output

First, output the number of the hotel you find, and from the next line, print them like the input( two numbers in one line). You should order them ascending first by price and break the same price by distance.

 

Sample Input

  
  

   
   3
15 10
10 15
8 9
  
  

 

Sample Output

  
  

   
   1
8 9
  
  

 

Author

ZSTU

 

Source

HDU 2009-12 Programming Contest

 

Recommend

lcy

#include <iostream>
#include <cstring>
#include <cmath>
#include <queue>
#include <stack>
#include <assert.h>
#include <list>
#include <map>
#include <set>
#include <string>
#include <cstdlib>
#include <cstdio>
#include <algorithm>
using namespace std;


int N;
struct Node
{
	int x,y;
	bool operator<(const Node&node) const
	{
		if(x == node.x)
		{
			return y < node.y;
		}
		return x < node.x;

	}
};
const int maxn = 10010;
Node node[maxn];
Node ans[maxn];
int cnt;
int main()
{
	freopen("1.txt","r",stdin);
	while(scanf("%d",&N) != EOF)
	{
		memset(ans,0,sizeof(ans));
		memset(node,0,sizeof(node));
		cnt = 0;
		int x,y;
		int lpos = 0;
		int lval = 0x3f3f3f3f;
		int rpos = 0;
		int rval = 0x3f3f3f3f;
		for(int i=0;i<N;i++)
		{
			scanf("%d%d",&x,&y);
			node[i].x = x ;
			node[i].y = y;
			if(i == 0 || node[i].x < lval || node[i].x == lval && node[i].y < node[lpos].y)
			{
						lpos = i;
				lval = node[i].x;
			}
			if(i == 0 || node[i].y < rval || node[i].y == rval && node[i].x < node[rpos].x)
			{
				rpos = i;
				rval = node[i].y;
			}
		}
		for(int i=0;i<N;i++)
		{
			if(node[i].x <= node[rpos].x && node[i].y <= node[lpos].y)
			{
				ans[cnt ].x = node[i].x;
				ans[cnt ].y = node[i].y;
				cnt ++;
			}
		}
		sort(ans,ans+cnt);
		printf("%d\n",cnt);
		for(int i=0;i<cnt;i++)
		{
			printf("%d %d\n",ans[i].x,ans[i].y);
		}
	}

}