高消20pts玄关求条

#include <bits/stdc++.h>

using namespace std;

const int N = 510;
const double eps = 1e-4;
struct Info {
	double a[N];
	int v;
} b[N];
int n, m, t, cnt, ans;

inline void Gauss() {
	t = n;
	for (int i = 1; i <= n; i++) {
		for (int j = i + 1; j <= n; j++) if (fabs(b[j].a[i]) > eps && b[j].v < b[i].v)
			swap(b[i], b[j]);
		if (fabs(b[i].a[i]) < eps) {
			t = i - 1;
			break;
		}
		for (int j = 1; j <= n; j++) if (j != i) {
			double rate = b[j].a[i] / b[i].a[i];
			for (int k = i; k <= m; k++)
				b[j].a[k] -= rate * b[i].a[k];
		}
	}
	for (int i = 1; i <= t; i++)
		ans += b[i].v;
}

int main() {
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
			scanf("%lf", &b[i].a[j]);
	for (int i = 1; i <= n; i++)
		scanf("%d", &b[i].v);
	Gauss();
	printf("%d %d\n", t, ans);
	return 0;
}