懒虫小鑫

PRoblem Description

Input

Output

Example Input

4 21 21 32 23 4
Example Output
5    #include <stdio.h>    struct node    {        int w;        int p;    }size[10001],t;    void sort(struct node size[],int n)    {        int i,j,flag;        for(i=0;i<n-1;i++)        {            flag=i;            for(j=i+1;j<n;j++)            {                if(size[j].w<size[flag].w)                {                    flag=j;                }                else if(size[j].w==size[flag].w)                {                    if(size[j].p>size[flag].p)                    {                        flag=j;                    }                }            }            if(flag!=i)            {                t=size[i];                size[i]=size[flag];                size[flag]=t;            }        }    }    int main()    {        int n,m,sum;        while(~scanf("%d %d",&n,&m))        {            sum=0;            int i;            for(i=0;i<n;i++)            {                scanf("%d %d",&size[i].w,&size[i].p);            }            sort(size,n);            for(i=0;i<m;i++)            {                sum+=size[i].p;            }            printf("%d/n", sum);        }        return 0;    }