单链表：求所有不及格人数的累计数

#include
#include
#include 
using namespace std;
typedef int ElemType;
#define M 20
typedef struct LNode
{
	ElemType data;	//定义数据与
	struct LNode* next;	//指针域
}LNode, * LinkList;
void CreateLink(LinkList& h, ElemType a[], int n)
{
	LinkList s, tc; int i;
	h = (LinkList)malloc(sizeof(LinkList));
	tc = h;
	for (i = 0; i data = a[i];
		tc->next = s;
		tc = s;
	}
	tc->next = NULL;
}
int Count(LinkList sl)
{
	int k = 0;
	LNode* p;
	if (sl->next == NULL)return 0;
	p = sl->next;

	//不及格判断
	while (p != NULL)
	{
		if (p->data next;
	}
	return k;
}
void main()
{
	int N;
	//cout