4004: [JLOI2015]装备购买 贪心+线性基

从小到大加入线性基。。

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#define eps 1e-5
using namespace std;
int n,m,cnt,ans;
int ins[1005];
struct node
{
    int c;
    double x[1005];
    double& operator[](int i)
    {
        return x[i];
    }
};
node a[1005];
inline int read()
{
    int a=0,f=1; char c=getchar();
    while (c<'0'||c>'9') {if (c=='-') f=-1; c=getchar();}
    while (c>='0'&&c<='9') {a=a*10+c-'0'; c=getchar();}
    return a*f;
}
inline bool operator<(node a,node b)
{
    return a.c<b.c;
}
int main()
{
    n=read(); m=read();
    for (int i=1;i<=n;i++)
        for (int j=1;j<=m;j++)
            scanf("%lf",&a[i][j]);
    for (int i=1;i<=n;i++) 
        a[i].c=read();
    sort(a+1,a+n+1);
    for (int i=1;i<=n;i++)
        for (int j=1;j<=m;j++)
            if (fabs(a[i][j])>eps)
            {
                if (ins[j])
                {
                    double t=a[i][j]/a[ins[j]][j];
                    for (int k=j;k<=m;k++)
                        a[i][k]-=t*a[ins[j]][k];
                }
                else 
                {
                    ins[j]=i;
                    ans+=a[i].c;
                    cnt++;
                    break;
                }
            }
    cout << cnt << " " << ans << endl;
}