UVALive 4731 Cellular Network

#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define se second
#define fs first
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define pii pair<int,int>
const int INF = 1000000000;
const int maxn = 105;
const int M = 4000;

int a[ maxn ], sum[ maxn ];
int dp[ maxn ][ maxn ];
int n, m;

int main()
{
    int T;
    scanf( "%d", &T );
    while( T -- )
    {
        scanf( "%d%d", &n, &m );
        for( int i = 1; i <= n; i ++ ) scanf( "%d", &a[ i ] );
        sort( a + 1, a + n + 1, greater< int >() );
        for( int i = 1; i <= n; i ++ ) sum[ i ] = sum[ i - 1 ] + a[ i ];
        for( int i = 1; i <= n; i ++ ) dp[ i ][ 1 ] = i * sum[ i ];
        for( int i = 2; i <= m; i ++ )
        for( int j = i; j <= n; j ++ )
        {
            dp[ j ][ i ] = INF;
            for( int k = i - 1; k <= j - 1; k ++ )
            dp[ j ][ i ] = min( dp[ j ][ i ], dp[ k ][ i - 1 ] + j * ( sum[ j ] - sum[ k ] ) );
        }
        printf( "%.4lf\n",( double )dp[ n ][ m ] / ( double )sum[ n ] );
    }
    return 0;
}