2000541_ac_0ms_132k.cpp

北大大牛代码 1240道题的原代码 超级权威

# include <iostream>
# include <vector>
# include <algorithm>

using namespace std;

bool cmp(const int a,const int b)
{
	return a>b;
}

int main()
{
	int t, i, n, sum;
	vector<int> a;

	cin>>t;
	while(t--)
	{
		cin>>n;
		sum = 0;
		int max = 0;
		a.resize(n);
		for(i = 0; i < n; i++)
			cin>>a[i];
		sort(a.begin(),a.end(),cmp);
		for(i = 0; i < n; i++)
		{
			sum += a[i];
			if(a[i]*(i+1)<=sum)
				if(a[i]*(i+1)>max)
					max = a[i]*(i+1);
		}
		cout<<max<<endl;
		//copy(a.begin(),a.end(),ostream_iterator<int>(cout," "));
	}
	return 1;
}