Codeforces Round #228 (Div. 1) C 贪心_html/css_WEB-ITnose

int n;typedef struct Node {	int mid;	int id;};Node node[100 + 55];int mp[100 + 55][100 + 55];int ss[100 + 55];void init() {	memset(ss,0,sizeof(ss));	memset(node,0,sizeof(node));}bool input() {	while(cin>>n) {		return false;	}	return true;}bool cmp(Node x,Node y) {	return x.mid > y.mid;}void cal() {	int ans1 = 0;	int ans2 = 0;	int cnt = 0;	for(int i=0;i<n;i++) {		scanf("%d",&ss[i]);		if(ss[i]&1) {			for(int j=1;j<=ss[i];j++) {				scanf("%d",&mp[i][j]);				if(j == (ss[i] + 1)/2) {					node[cnt].id = i;					node[cnt++].mid = mp[i][j];				}			}		}		else {			for(int j=1;j<=ss[i];j++) {				int x;				scanf("%d",&x);				if(j <= ss[i]/2) ans1 += x;				else ans2 += x;			}		}	}	sort(node,node + cnt,cmp);	int mark = 1;	for(int i=0;i<cnt;i++) {		if(mark > 0) {			int k = node[i].id;			for(int j=1;j<=(ss[k] + 1)/2;j++)				ans1 += mp[k][j];			for(int j=(ss[k] + 1)/2 + 1;j<=ss[k];j++)				ans2 += mp[k][j];		}		else {			int k = node[i].id;			for(int j=1;j<=ss[k]/2;j++)				ans1 += mp[k][j];			for(int j=(ss[k] + 1)/2;j<=ss[k];j++)				ans2 += mp[k][j];		}		mark *= -1;	}	cout<<ans1<<" "<<ans2<<endl;}void output() {}int main() {	while(true) {		init();		if(input())return 0;		cal();		output();	}	return 0;}