7-1 linked list is also simple fina

Form a linked list of students' grades . The structure of the list is as follows ：
struct student {
string name; // The student's name
double gpa; // Grade point
student *next;
};

The input is the name and grade point of a group of students , Store as a linked list . Delete the student node whose grade point is less than the average grade point , Become a new linked list . Then follow the order of input , Output the student information of the new linked list in order . GPA is the arithmetic mean of all student grades entered .

Input format :

The input consists of several lines . Each line is for a student Name and grade point , Space off .
The last line is -1.

Output format :

Output includes student name . One line for each student's name .

sample input :

zhang 3.5
liu 2.1
tie 1.9
-1

sample output :

zhang

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
struct stu {
char name[20]; 
double s; 
struct stu *next;
};
struct stu *create();
struct stu *del(struct stu *head,double score);
double average(struct stu *head);
void printlist(struct stu *head);
int main()
{
	double s;
	struct stu *head=NULL;
	head=create();
	s=average(head);
	head=del(head,s);
	printlist(head);
	return 0;
 } 
struct stu *create()
{
	struct stu *head=NULL,*p,*tail;
	char name[20];
	while(1)
	{
        scanf("%s",name);
        if(name[0]=='-')
            break;
		p=(struct stu *)malloc(sizeof(struct stu));
		strcpy(p->name,name); 
		scanf("%lf",&p->s);
		if(head==NULL)
		{
		head=tail=p;
		}
		else
		{
		tail->next=p;
		}
		tail=p;
	}
    tail->next = NULL;
	return head;
}
struct stu *del(struct stu *head,double score)
{
	struct stu *p,*p1;
	while(head!=NULL&&head->s<score)
	{
		p=head;
		head=head->next ;
		free(p);
	}
	if(head==NULL)  return NULL;
	p=head,p1=head->next ;
	while(p1!=NULL)
	{
		if(p1->s <score)
		{
			p->next = p1->next ;
			free(p1);
		}
		else
		{
			p=p->next;
			
		}
		p1=p->next ;
	}
	return head;
}
double average(struct stu *head)
{
	double s=0,count=0;
	struct stu *p;
	for(p=head;p!=NULL;p=p->next)
	{
		s+=p->s;
		count++;
	}
	s=s/count;
	return s;
}
void printlist(struct stu *head)
{
	struct stu *p;
	for(p=head;p!=NULL;p=p->next)
	{
		printf("%s\n",p->name);
	}
}

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
struct stu {
char name[20]; 
double s; 
struct stu *next;
};
struct stu *del(struct stu *head,double score);
int main()
{
	double s;
	int count=0;
	struct stu *head=NULL,*p,*tail;
	char name[20];
	while(1)
	{
        scanf("%s",name);
        if(name[0]=='-')
            break;
		p=(struct stu *)malloc(sizeof(struct stu));
		strcpy(p->name,name); 
		scanf("%lf",&p->s);
		s+=p->s;
		if(head==NULL)
		{
		head=tail=p;
		}
		else
		{
		tail->next=p;
		}
		tail=p;
		count++;
	}
    tail->next = NULL;
    s=s/count;
	for(p=head;p!=NULL;p=p->next)
	{
		if(p->s>s){
				printf("%s\n",p->name);
		}
	
	}
	return 0;
 }