bzoj4004

#include<bits/stdc++.h>
using namespace std;
#define double long double
const double eps = 1e-5;
const int N = 1005;
int n, ans1, ans2, m;
int vis[N];
struct data {
    double p[N];
    int val;
    bool friend operator < (const data &a, const data &b) {
        return a.val < b.val;
    }
} a[N];
int main() 
{
    ios::sync_with_stdio(0);
    cin >> n >> m;
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= m; ++j)
            cin >> a[i].p[j];
    for(int i = 1; i <= n; ++i) 
        cin >> a[i].val;
    sort(a + 1, a + n + 1);
    for(int i = 1; i <= n; ++i) 
        for(int j = 1; j <= m; ++j) 
        {
            if(!vis[j])
            {
                if(fabs(a[i].p[j]) > eps) 
                {
                    vis[j] = i;
                    ans1 += a[i].val;
                    ++ans2;
                    break;  
                }   
            } 
            else
            {
                double t = a[i].p[j] / a[vis[j]].p[j];
                for(int k = 1; k <= m; ++k) a[i].p[k] -= t * a[vis[j]].p[k];
            }
        }
    printf("%d %d\n", ans2, ans1);
    return 0;
}