2675.txt

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

Problem Id:2675  User Id:fzk 
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <math.h>
const double eps = 1e-6;
using namespace std;
double v[70000];
int id[70000], s[70000], l[70000];
bool cmp( int a, int b )
{
	return v[a]*l[b] < v[b]*l[a];
}
int main( )
{
	int i, n, a;
	while( scanf( "%d", &n ) == 1 )
	{
		for( i=0; i<n; i++ )
		{
			scanf( "%d%d%lf", id+i, l+i, v+i ); 
			s[i] = i;
		}
		sort( s, s+n, cmp );
		scanf( "%d", &a );
		printf( "%d\n", id[ s[n-a] ] );
	}
	return 0;
}