BZOJ4004&&洛谷P3265 [JLOI2015]装备购买

贪心+高斯消元+线性基 

求一个线性无关也就是线性基，但要求花费最小，所以用花费贪一下心

代码

//By AcerMo
#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int M=550;
const double eps=1e-7;
struct xxj
{
	int cost;double x[M];
}e[M];
int n,m;
int vis[M];
bool cmp(xxj a,xxj b){return a.cost<b.cost;}
void slove()
{
	int ans=0,que=0;
	for (int i=1;i<=n;i++)
	for (int k=1;k<=m;k++)
	if (fabs(e[i].x[k])>eps)
	{
		if (vis[k]) 
		{
			double mul=e[i].x[k]/e[vis[k]].x[k];
			for (int j=k;j<=m;j++)
				e[i].x[j]-=(mul*e[vis[k]].x[j]);
		}
		else {vis[k]=i;ans+=e[i].cost;que++;break;}
	}
	cout<<que<<" "<<ans;
	return ;
}
int main()
{
	scanf("%d%d",&n,&m);
	for (int i=1;i<=n;i++)
	for (int k=1;k<=m;k++) 
	scanf("%lf",&e[i].x[k]);
	for (int i=1;i<=n;i++)
	scanf("%d",&e[i].cost);
	sort(e+1,e+n+1,cmp);
	slove();
	return 0;
}