题目：
编一程序，输入职员工号和完成产品数量，程序允许同一职工有多次输入，
由程序对其完成数量实现累计。程序按完成数量对它们排序，并确定名次。
按完成产品数量由多到少顺序，输出名次、同一名次的职员人数及他们的工号（工号由大到小）。
要求程序用有序链表储存数据信息.

都 没人会啊！看来 难度蛮大的

晕   又是这种卖力的程序~
       用结构体去做，
给你个链表的模板   在自己去琢磨
     举一反三出来
#include <stdio.h>
#include <stdlib.h>

struct numstruct
{
    int num;
    char name[20];
    struct numstruct *next;
};

void main()
{
    struct numstruct *Head;
    struct numstruct *New;
    struct numstruct *Tail;
    int stuNum=0;
    while(1)
    {
        if((New = (struct numstruct *)malloc(sizeof(struct numstruct)))==NULL)
        {
            printf("内存空间开辟失败，程序结束\n");
            exit(0);
        }
        printf("请输入第%d个学生的学号：",stuNum+1);
        scanf("%d",&New->num);
        printf("请输入第%d个学生的姓名：",stuNum+1);
        scanf("%s",&New->name);
        New->next=NULL;
        if(stuNum==0)
        {
            Head=New;
        }
        else
        {
            Tail->next=New;
        }
        Tail=New;
        stuNum++;
        if(stuNum==3)
        {
            break;
        }
    }
    do
    {
        printf("%d\n",Head->num);
        printf("%s\n",Head->name);
        Head=Head->next;
    }
    while(Head!=NULL);
}

收到的鲜花

• 书画家怀 于 2009-12-23 11:22 送鲜花  1朵   附言：我很赞同

#include <stdio.h>

struct tafWorker
{   int iNumber;
    int iProductCount;
    struct tafWorker *pNext,*pPrev;
}

typedef stuct tafWorker worker;
worker *pHead

void main()
{
    int i,j;
    worker workArray[5] = {{105,0,NULL},{104,0,NULL},
                           {103,0,NULL},{102,0,NULL},{101,0,NULL}};
    pHead = workArray;
    for(i=0;i<4;++i)
    {
        workArray[i].pNext = Head+i+1;
        if(i !=0 ) workArray[i].pPrev = head +i-1;
    }
        
    while(i!=0)
    {
        scanf("%d,%d",&i,&j);
        InputData(i,j);
     }
     OutPutData(p);
}

void InputData(int iNum,int iProdCount)
{
    worher *pCur=pHead,*pTmp;
    while(pCur->pNext != NULL)
    {
         if(iNum == pCur->iNumber)
         {
             pCur->iProductCount += iProdCount;
             pTmp = pCur;
             while(pTmp = pTmp->pPrev != NULL)
             {
                  if(pTmp->iProDuctCount > pCur->iProductCount
                  ||(pTmp->iProDuctCount = pCur->iProductCount && pTmp->iNumber > pCur->iNumber)
                  {
                       InterChange(pCur,pTmp);
                       break;
                   }
              }
          }
     }
}
  
void InterChange(worker *pCur,worker *pTmp)
{
    worker workTmp;
    workTmp.iNumber = *Pcur;
    *pCur = *pTmp;
    *pTmp = workTmp;
}

void Output(worker *p);
{
    while(p != Null)
    {
        printf("%5d %5d\n",p->iNumber,p->iProductCount);
        p=p->pNext;
    }
}                     
                                

收到的鲜花

• 书画家怀 于 2009-12-23 11:23 送鲜花  1朵