void xoaCBsucchuabehon100(CBlist& l)
{
	if (l.head == NULL) {
		return;
	}
	while (l.head != NULL && l.head->x.succhua < 100) {
		NodeCB* p = l.head;
		l.head = l.head->next;
		delete p;
	}
	NodeCB* prev = l.head;
	NodeCB* cur = l.head->next;
	while (cur != NULL) {
		if (cur->x.succhua < 100) {
			NodeCB* q = cur;
			prev->next = cur->next;
			cur = cur->next;
			delete q;
		}
		else {
			prev = cur;
			cur = cur->next;
		}
	}
}