//E
#include <stdio.h>
#include <memory.h>
#include <algorithm>
using namespace std;
#define N 10000
int dis[N],price[N];
int myindex[N];
bool cmp(int a,int b)
{
	return dis[a]<dis[b]||(dis[a]==dis[b]&&price[a]<price[b]);
}
int solve(int n)
{
	int i,pre=100000000,re=0;
	for ( i=0;i<n;i++ )myindex[i]=i;
	sort(myindex,myindex+n,cmp);
	for ( i=0;i<n;i++ )
	{
		if ( price[myindex[i]]<pre)
		{
			pre=price[myindex[i]];
			re++;
		}
	}
	return re;
}
int main()
{
	int n,i;
	while ( scanf("%d",&n),n )
	{
		for ( i=0;i<n;i++ )scanf("%d %d",dis+i,price+i);
		printf("%d\n",solve(n));
	}
	return 0;
}

• Re:请教只排一次序的算法,我排了两次,1xxxMS (707) 147465758 2005-12-31 11:03:33
• 这个算法对吗 看下面这组测试数据 (101) alpc12 2006-12-12 09:52:19
  • Re:这个算法对吗 看下面这组测试数据 (127) yujiashan 2006-12-22 13:46:10
  • Re:明明就是对的，自己研究好了再来否定别人嘛... (144) yujiashan 2006-12-22 13:48:35