2018_2_8_Holiday Hotel_结构体排序

最新推荐文章于 2021-01-22 17:15:55 发布

ujn20161222

最新推荐文章于 2021-01-22 17:15:55 发布

阅读量259

点赞数

本文链接：https://blog.csdn.net/ujn20161222/article/details/79287039

版权

poj 同时被 2 个专栏收录

130 篇文章 0 订阅

订阅专栏

排序

12 篇文章 0 订阅

订阅专栏

Language:

Holiday Hotel

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 8532		Accepted: 3339

Description

Mr. and Mrs. Smith are going to the seaside for their holiday. Before they start off, they need to choose a hotel. They got a list of hotels from the Internet, and want to choose some candidate hotels which are cheap and close to the seashore. A candidate hotel M meets two requirements:

Any hotel which is closer to the seashore than M will be more expensive than M.
Any hotel which is cheaper than M will be farther away from the seashore than M.

Input

There are several test cases. The first line of each test case is an integer N (1 <= N <= 10000), which is the number of hotels. Each of the following N lines describes a hotel, containing two integers D and C (1 <= D, C <= 10000). D means the distance from the hotel to the seashore, and C means the cost of staying in the hotel. You can assume that there are no two hotels with the same D and C. A test case with N = 0 ends the input, and should not be processed.

Output

For each test case, you should output one line containing an integer, which is the number of all the candidate hotels.

Sample Input

Sample Output

Source

Beijing 2005

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string> 
#include<cctype>
#include<vector>
#include<algorithm> 
#include<map>
#include<set>
using namespace std;

const int N=1e4+10;

struct AA{
	int d;
	int c;
	void input(){
		scanf("%d%d",&d,&c);
	}
}a[N];
int n;

bool cmp(AA a,AA b){
	if(a.d==b.d)return a.c<b.c;
	return a.d<b.d;
}

int main(){
	while(scanf("%d",&n),n){
		for(int i=0;i<n;i++)
		a[i].input();
		sort(a,a+n,cmp);
		int ans=1,p=0;
		for(int i=1;i<n;i++)
		if(a[i].c<a[p].c){
			ans++;p=i;
		}
		printf("%d\n",ans);
	}
}