2726.txt

北大ACM题目例程 详细的解答过程 程序实现 算法分析

Source

Problem Id:2726  User Id:fzk 
Memory:80K  Time:109MS
Language:C++  Result:Accepted

Source 

#include <algorithm>
#include <stdio.h>

using namespace std;

typedef pair<int,int> p_i;

p_i p[10000];

int main( ) {
	int n, i, j;
	int s, ans;
	while( scanf( "%d", &n ) == 1 && n > 0 ) {
		
		for( i=0; i<n; i++ )
			scanf( "%d%d", &p[i].first, &p[i].second );
		sort( p, p+n );
		
		ans = 0; s = 10000000;

		for( i=0; i<n; i=j ) {
			for( j=i; j<n && p[i] == p[j]; j++ )
				;
			if( p[i].second < s ) {
				ans += j-i;
				s = p[i].second;
			}
		}

		printf( "%d\n", ans );
	}
	return 0;
}