Cellular Network LA4731

排序后DP，可以用反正法证明，假设在最优策略下有概率r[i] > r[j],且i < j,则交换这俩个概率的位置，则可已得到更优解，这与假设相矛盾，所以必有概率是降序排列的

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <algorithm>
#include <vector>
#include <cstring>
#include <stack>
#include <cctype>
#include <utility>   
#include <map>
#include <string>  
#include <climits> 
#include <set>
#include <string> 
#include <sstream>
#include <utility>
#include <ctime>
 
using std::priority_queue;
using std::vector;
using std::swap;
using std::stack;
using std::sort;
using std::max;
using std::min;
using std::pair;
using std::map;
using std::string;
using std::cin;
using std::cout;
using std::set;
using std::queue;
using std::string;
using std::istringstream;
using std::make_pair;
using std::greater;
using std::endl;

const int MAXN(110);
const double INFI(1e30);

int arr[MAXN];
double sum[MAXN];
double table[MAXN][MAXN];
bool comp(int op1, int op2)
{
	return op1 > op2;
}

int main()
{
	int T;
	scanf("%d", &T);
	while(T--)
	{
		int n, w;
		scanf("%d%d", &n, &w);
		int ts = 0;
		for(int i = 1; i <= n; ++i)
		{
			scanf("%d", arr+i);
			ts += arr[i];
		}
		sort(arr+1, arr+1+n, comp);
		for(int i = 1; i <= n; ++i)
			sum[i] = sum[i-1]+(double)arr[i]/ts;
		for(int i = 1; i <= n; ++i)
		{
			table[i][1] = sum[i]*i;
			int lim = min(i, w);
			for(int j = 2; j <= lim; ++j)
			{
				table[i][j] = INFI;
				for(int k = i-1; k >= j-1; --k)
					table[i][j] = min(table[i][j], table[k][j-1]+(sum[i]-sum[k])*i);
			}
		}
		printf("%.4f\n", table[n][w]);
	}
	return 0;
}