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 scanf if for j="1;j<=ss[i];j++)" node i mp else int x ss ans1 ans2 sort cnt mark="1;"> 0) {			int k = node[i].id;			for(int j=1;j  <br>  <br>  <p></p> </n>