{int num;char str[20];
stuuct node*next;
};
struct node*insert(head,pstr,n)
struct node*head;
char*pstr;int n;
{sruct node*p1,*p2,*p3;
p1=(struct node*)malloc(sizeof(struct node))
strcpy(p1->str,pstr);
p1->num=n;p2=head;
if(head==null)
{
head=p1;p1->next=null;}
else{
while(n>p2->num&&p2->next!=null)
{p3=p2;p2=p2->next;}
if(n<=p2->num)if(head==p2)
{head=p1;p->next=p2;}
else{p3->nextp1;p1->next=p2;}
else{p2->next=p1;p1->next=null;}
}return(head);
}