toj_2953.cpp

Tianjin University Online Judge 的80多道题目 .

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#define MAXNUM 510
int n ,  p[ 2 ][ MAXNUM ] , move;

int compareInt( const void * a , const void * b )
{
	return *( int * ) a  - *( int * ) b;
}

void findMove( int a )
{
	int i , j;
	qsort( p[ a ] , n , sizeof( int ) , compareInt );
	for(  i = 0; i < n; i++ )
		move += abs( p[ a ][ i ] - i );
}

int main()
{
	int i , j , k;
	scanf( "%d" , &n );
	for( i = 0; i < n; i++ ){
		scanf( "%d%d" , &p[ 0 ][ i ], &p[ 1 ][ i ]);
		p[ 0 ][ i ]--;
		p[ 1 ][ i ]--;
	}
	move = 0;
	findMove( 0 );
	findMove( 1 );
	printf( "%d\n" , move );
	system( "pause");
	return 0;
}