hdu 6803

题目

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=6803

代码

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<ctime>
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
#include<fstream>
#include<complex>
#include<algorithm>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#define int long long
using namespace std;
const int INF = 0x3f3f3f3f;
int a[10010];
signed main(){
//	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	int t;
	scanf("%lld",&t);
	while(t--){
		int n;
		scanf("%lld",&n);
		//double maxn=-1;
		int res=0;
		int x,y;
		for(int i=1;i<=n;i++){ 
			scanf("%lld%lld",&x,&y);
			a[i]=(100-x)/x*y;
			if(100%x) a[i]+=y;
		}
	//	cout<<1<<endl;
		sort(a+1,a+1+n);
		for(int i=1;i<=n;i++){
			if(a[i]==a[1]) res++;
		}
		double ans=res*1.0/(2*n)+(n-res)*1.0/n;
        cout<<ans<<endl;
	}
    return 0;
}