1794.txt

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

#include <stdio.h>
#include <math.h>
#include <memory.h>

int s1[60010], s2[60010];

int main ( )
{
	int cas, i, n, m, k, a, b, ans;

	scanf( "%d", &cas );

	for( k=1; k<=cas; k++ )
	{
		scanf( "%d %d", &n, &m );
		
		memset( s1, 0, sizeof s1 );
		memset( s2, 0, sizeof s2 );

		for( i=0; i<n; i++ )
		{
			scanf( "%d %d", &a, &b );
			s1[a]++;
			s2[b]++;
		}

		for( i=1; i<=n+m; i++ )
			s1[i] += s1[i-1], s2[i] += s2[i-1];

		ans = 0;
		for( i=0; i<m; i++ )
		{
			scanf( "%d %d", &a, &b );
			if( s1[a] >= s2[b] )
				ans += s1[a] - s2[b-1];
			else
				ans += s2[b] - s1[a];
		}

		printf( "Scenario #%d:\n", k );
		printf( "%d\n\n", ans );
	}

	return 0;
}