P3265 [JLOI2015]装备购买 —— 线性基

Link
实数下线性基

#define double long double
double a[N][N];
struct node {
    double a[550];
    int w;
    bool operator < (const node &x) const {
        return w < x.w;
    }
}p[550];
int n, m;
double b[N][N];
bool insert(int m, double c[]) {
    for(int i = m-1; i >= 0; i--) {
        if(fabs(c[i]) < EPS) continue;
        if(fabs(b[i][i]) < EPS) {
            for(int j = 0; j < m; j++)
                b[i][j] = c[j];
            return true;
        }
        double t = c[i]/b[i][i];
        for(int j = 0; j < m; j++)
            if(fabs(c[i]) > EPS)
                c[j] -= b[i][j] * t;
    }
    return false;
}
void solve() {
    cin >> n >> m;
    for(int i = 0; i < n; i++)
        for(int j = 0; j < m; j++)
            cin >> p[i].a[j];
    for(int i = 0; i < n; i++)
    {
        cin >> p[i].w;
        p[i].a[m] = p[i].w;
    }
    sort(p, p + n);
    int cnt = 0, res = 0;
    for(int i = 0; i < n; i++) {
        if(insert(m, p[i].a)) {
            cnt++;
            res += p[i].w;
        }
    }
    cout << cnt << ' ' << res << endl;
}