寒假集训第二天习题

NEFUOJ1482

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int a,b[10];

    cin>>a;
    for(int i=0; i<a; i++)
        cin>>b[i];
    for(int i=0; i<a; i++)
        if(b[i]%2==0)
            b[i]=0;

    sort(b,b+a);
    for(int i=0; i<a-1; i++)
        if(b[i]!=0)
            cout<<b[i]<<",";
    cout<<b[a-1];

    return 0;
}

NEFUoj1650

#include <bits/stdc++.h>

using namespace std;
int n,k;
int a[100001];
int ans=0;
int main()
{

    int x;
    cin>>n>>k;
    for(int i=1; i<=n; i++)
    {
        cin>>x;
        a[x]++;
    }
    int num=0,tmp=0;
    for(int i=100000; i>=1; i--)
    {
        if(a[i]!=0)
        {
            num=num+a[i];
            ans=ans+a[i]*i;
            tmp=i;
        }
        if(num>=k)
            break;
    }
    if(num==k)
        cout<<ans<<endl;
    else
    {
        ans=ans-tmp*(num-k);
        cout<<ans<<endl;
    }
    //cout << "Hello world!" << endl;
    return 0;
}

**NEFUoj 554 **

#include <bits/stdc++.h>

using namespace std;
struct heshang
{
    int zong,c,xian,gao,yin,xu;
} he[200];

int cmp(const struct heshang a,const struct heshang b)
{
    if(a.zong!=b.zong)
        return a.zong>b.zong;
    else if(a.c!=b.c)
        return a.c>b.c;
    else if(a.xian!=b.xian)
        return a.xian>b.xian;
    else if(a.gao!=b.gao)
        return a.gao>b.gao;
    else if(a.yin!=b.yin)
        return a.yin>b.yin;
    else if(a.xu!=b.xu)
        return a.xu>b.xu;
}

int main()
{
    int i,n;
    while (cin>>n)
    {


        for(i=0; i<n; i++)
        {
            cin>>he[i].c>>he[i].xian>>he[i].gao>>he[i].yin;
            he[i].zong=he[i].c+he[i].xian+he[i].gao+he[i].yin;
            he[i].xu=i;
        }

        sort(he,he+n,cmp);
        for(i=0; i<n; i++)
            cout<<he[i].xu+1<<" "<<he[i].zong<<endl;
    }


    return 0;
}

NEFU oj873

#include <stdio.h>

#include <stdlib.h>

#include<string.h>

#include<algorithm>

using namespace std;

struct student

{

    char name[25];

    double score1,score2,score3,sum;



} p[1000],temp;

bool cmp(struct student a,struct student b )

{

    if(a.sum!=b.sum)

    return a.sum>b.sum;

    else if(a.score1!=b.score1)

    return a.score1>b.score1;

    else if(a.score2!=b.score2)

    return a.score2>b.score2;

    else return a.score3<b.score3;

}

int main()

{

    int n;

    while(scanf("%d",&n)!=EOF)

    {

        int m=0;

        for(m=0; m<n; m++)

        {

            int i,j,a,b,x;

            float A,B,C,s;

            scanf("%d%f%f%f",&x,&B,&A,&C);

            for(i=0; i<x; i++)

            {

                scanf("%s",p[i].name);

                scanf("%lf%lf%lf",&p[i].score1,&p[i].score2,&p[i].score3);

                p[i].score1=p[i].score1*A/100.0000;

                p[i].score2=p[i].score2*B/100.0000;

                p[i].score3=p[i].score3*C/100.0000;

                p[i].sum=p[i].score1+p[i].score2+p[i].score3;

            }

           sort(p,p+x,cmp);

            printf("Case #%d:\n",m+1);

            for(i=0; i<x; i++)

            {

                printf("%s",p[i].name);

                printf(" %.4f %.4f %.4f %.4f\n",p[i].sum,p[i].score1,p[i].score2,p[i].score3);

            }

        }

    }

    return 0;

}

NEFU oj 874

```cpp
#include <bits/stdc++.h>

using namespace std;
struct team
{
    char name[20];
    int num[5],time[5],sum,zong;

} t[100001];
int cmp(const struct team a,const struct team b)
{
    if(a.sum==b.sum)
        return(a.zong<b.zong);
    if(a.sum!=b.sum)
        return(a.sum>b.sum);
}
int main()
{
    int n,i;
    while(cin>>n)
    {
        for(i=0; i<n; i++)
            cin>>t[i].name>>t[i].time[0]>>t[i].time[1]>>t[i].time[2];
        for(i=0; i<n; i++)
            cin>>t[i].num[0]>>t[i].num[1]>>t[i].num[2];
        for(i=0; i<n; i++)
        {
            t[i].sum=0;
            t[i].zong=0;
            for(int j=0; j<3; j++)
                if(t[i].time[j]!=-1)
                    t[i].sum++;
            for(int j=0; j<3; j++)
                if(t[i].time[j]!=-1)
                {
                    t[i].zong=t[i].zong+t[i].time[j];
                    if(t[i].num[j]!=1)
                        t[i].zong=t[i].zong+20*t[i].num[j]-20;
                }

        }
        sort(t,t+n,cmp);
        for(i=0; i<n; i++)

            cout<<t[i].name<<" "<<t[i].sum<<" "<<t[i].zong<<endl;

    }



    return 0;
}

**NEFU oj1267**
![在这里插入图片描述](https://img-blog.csdnimg.cn/20200101195346332.jpg?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQ1Njg3MDAy,size_16,color_FFFFFF,t_70)

#include <bits/stdc++.h>

using namespace std;
struct zuob
{
    int x,y;
} zu[150];
int cmp1(const struct zuob &a,const struct zuob &b)
{
    if(a.x==b.x)
        return a.y>b.y;
    else return a.x>b.x;
}

int cmp2(const struct zuob &a,const struct zuob &b)
{
    if(a.x==b.x)
        return a.y<b.y;
    else return a.x>b.x;
}

int cmp3(const struct zuob &a,const struct zuob &b)
{
    if(a.x==b.x)
        return a.y<b.y;
    else return a.x<b.x;
}


int cmp4(const struct zuob &a,const struct zuob &b)
{
    if(a.x==b.x)
        return a.y>b.y;
    else return a.x<b.x;
}


int main()
{
    int a,b,n,i;

    while(cin>>a>>b>>n)

    {   i=0;
        memset(zu,0,sizeof(zu));
        for(i=0; i<n; i++)

            cin>>zu[i].x>>zu[i].y;
        if(a==1&&b==1)
            sort(zu,zu+n,cmp3);
        if(a==1&&b==0)
            sort(zu,zu+n,cmp4);
        if(a==0&&b==0)
            sort(zu,zu+n,cmp1);
        if(a==0&&b==1)
            sort(zu,zu+n,cmp2);



        for(int j=0; j<n; j++)
            printf("(%d,%d)\n",zu[j].x,zu[j].y);
    }
    return 0;
}