6379:统计学生信息（使用动态链表完成）

#include<iostream>
using namespace std;
struct Node
{
    void showinfo()
    {
        cout<<x<<" ";
    }
    int x;
    Node *next;
};


int main()
{
    int n, x, k;
    Node *first, *tail=NULL, *p, *q;
    first = new Node;
    first->next = NULL;
    cin>>n;

    for(int i=0; i<n; i++)
    {
        cin>>x;
        if(i==0)
        {
            tail = new Node;
            tail->x = x;
            tail->next = NULL;
            first->next = tail;
            continue;
        }
        p = new Node;
        p->x = x;
        p->next = NULL;
        tail->next = p;
        tail = p;
    }

    cin>>k;
    q = first;
    p = first->next;
    while(p)
    {
        x = p->x;

        if(x == k)
        {
            q->next = p->next;
            delete p;
            p = q-&g