HDU 5499 SDOI(排序)——BestCoder Round #59(div.2)

最新推荐文章于 2018-10-05 20:42:00 发布

queuelovestack

最新推荐文章于 2018-10-05 20:42:00 发布

阅读量1k

点赞数

分类专栏： HDU OJ Best Coder 文章标签： acm sort

本文链接：https://blog.csdn.net/queuelovestack/article/details/49357865

版权

HDU OJ 同时被 2 个专栏收录

189 篇文章 1 订阅

订阅专栏

Best Coder

76 篇文章 0 订阅

订阅专栏

SDOI

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)

Problem Description

The Annual National Olympic of Information(NOI) will be held.The province of Shandong hold a Select(which we call SDOI for short) to choose some people to go to the NOI.

n(n≤100) people comes to the Select and there is

m(m≤50) people who can go to the NOI.

According to the tradition and regulation.There were two rounds of the SDOI, they are so called "Round 1" and "Round 2", the full marks of each round is

300 .

All the n people take part in Round1 and Round2, now the original mark of every person is known. The rule of SDOI of ranking gets to the "standard mark". For each round there is a highest original mark,let's assume that is

x .(it is promised that not all person in one round is 0,in another way,

x>0 ). So for this round,everyone's final mark equals to his/her original

mark∗(300/x) .

After we got everyone's final mark in both round.We calculate the Ultimate mark of everyone as

0.3∗round1′s final mark +

0.7∗round2′s final mark.It is so great that there were no two persons who have the same Ultimate mark.

After we got everyone's Ultimate mark.We choose the persons as followed:

To encourage girls to take part in the Olympic of Information.In each province,there has to be a girl in its teams.

1. If there is no girls take part in SDOI,The boys with the rank of first m enter the team.
2. If there is girls, then the girl who had the highest score(compared with other girls) enter the team,and other(boys and other girls) m-1 people with the highest mark enter the team.

Just now all the examination had been finished.Please write a program, according to the input information of every people(Name, Sex ,The original mark of Round1 and Round2),Output the List of who can enter the team with their Ultimate mark decreasing.

Input

There is an integer

T(T≤100) in the first line for the number of testcases and followed

T testcases.

For each testcase, there are two integers

n and

m in the first line

(n≥m) , standing for the number of people take part in SDOI and the allowance of the team.Followed with

n lines,each line is an information of a person. Name(A string with length less than

20 ,only contain numbers and English letters),Sex(male or female),the Original mark of Round1 and Round2 (both equal to or less than

300 ) separated with a space.

Output

For each testcase, output "The member list of Shandong team is as follows:" without Quotation marks.

Followed

m lines,every line is the name of the team with their Ultimate mark decreasing.

Sample Input

  
  
   
   2
10 8
dxy male 230 225
davidwang male 218 235
evensgn male 150 175
tpkuangmo female 34 21
guncuye male 5 15
faebdc male 245 250
lavender female 220 216
qmqmqm male 250 245
davidlee male 240 160
dxymeizi female 205 190
2 1
dxy male 300 300
dxymeizi female 0 0

Sample Output

  
  
   
   The member list of Shandong team is as follows:
faebdc
qmqmqm
davidwang
dxy
lavender
dxymeizi
davidlee
evensgn
The member list of Shandong team is as follows:
dxymeizi


Hint
For the first testcase: the highest mark of Round1 if 250,so every one's mark times(300/250)=1.2, it's same to Round2.
The Final of The Ultimate score is as followed
faebdc 298.20
qmqmqm 295.80
davidwang 275.88
dxy 271.80
lavender 260.64
dxymeizi 233.40
davidlee 220.80
evensgn 201.00
tpkuangmo 29.88
guncuye 14.40

For the second testcase,There is a girl and the girl with the highest mark dxymeizi enter the team, dxy who with the highest mark,poorly,can not enter the team.

Source

BestCoder Round #59 (div.2)

/************************************************************************/

附上该题对应的中文题

SDOI

Time Limit: 2000/1000 MS (Java/Others)

Memory Limit: 131072/131072 K (Java/Others)

问题描述

一年一度的全国信息学奥林匹克竞赛（NOI）即将举办，SD省组织进行了一次省队选拔，一共有  $\leq 100)$ 名选手参加了这次省队选拔。
今年，SD省的省队名额为  $\leq 50)$  人，即，今年的SD省队有  $m$  名队员。

按照惯例，SD省的省队选拔有两轮比赛，依次为“Round1”和“Round2”，每个Round的满分为  $300$  分。
所有 n 名选手都参加了Round1和Round2，现在每名选手Round1和Round2的“原始得分”已经确定。SD省的省队选拔采用标准分计算方式，即，设某个Round的最高原始得分为  $x$  分（保证每轮比赛都不会全场零分，即 $x > 0$ ），那么此Round每名选手的“相对得分”为: 这名选手此Round的原始得分 $* (300 / x)$ 。
所有选手的Round1和Round2的相对得分计算完毕后，将计算每名选手的“最终成绩”。一名选手的最终成绩为：这名选手的Round1相对得分 $* 0.3$  + 这名选手的Round2相对得分 $* 0.7$ 。非常和谐的是，保证不存在两名选手的最终成绩相等。

所有选手的最终成绩计算完毕后，将会按照以下规则选出省队队员：
为了鼓励女生参加信息学奥赛及相关活动，在有女选手参加省队选拔的情况下，省队中有一个固定的女选手名额。
1）若没有女选手参加省队选拔，则最终成绩最高的  $m$  位选手进入省队。
2）若有女选手参加省队选拔，则最佳女选手（女选手中最终成绩最高者）进入省队，其余的选手（男选手和最佳女选手之外的女选手）中成绩最高的  $m - 1$  位选手进入省队。

现在已经到了省队选拔的最后阶段，请你编写一个程序，根据输入的所有选手的信息（姓名，性别，Round1和Round2的原始得分），输出进入省队的选手的姓名，输出的姓名按照省队队员的最终成绩降序（从高到低）排列。

输入描述

第一行为一个整数  $\leq 100)$ ，表示数据组数。
接下来有 $T$ 组数据。
对于每组数据，第一行有两个正整数  $n$  和  $\geq m)$ ，分别表示参加省队选拔的选手人数和省队的名额数。接下来有  $n$  行，每行输入一名选手的信息，共4项，依次为姓名（一个长度不超过20的字符串，只包含数字和大小写英文字母）、性别（一个字符串，为"male"[男]或"female"[女]）、Round1原始得分（小于等于300的非负整数）和Round2原始得分（小于等于300的非负整数）。各项之间用空格隔开。

输出描述

对于每组数据，先输出一行"The member list of Shandong team is as follows:"(不带引号),接下来输出 $m$ 行，每行为一名省队队员的姓名，按省队队员的最终成绩降序（从高到低）排列。

输入样例

2
10 8
dxy male 230 225
davidwang male 218 235
evensgn male 150 175
tpkuangmo female 34 21
guncuye male 5 15
faebdc male 245 250
lavender female 220 216
qmqmqm male 250 245
davidlee male 240 160
dxymeizi female 205 190
2 1
dxy male 300 300
dxymeizi female 0 0

输出样例

The member list of Shandong team is as follows:
faebdc
qmqmqm
davidwang
dxy
lavender
dxymeizi
davidlee
evensgn
The member list of Shandong team is as follows:
dxymeizi

Hint

第一组数据：第一轮最高分为 $250$ ,所以每个人的成绩都要乘 $(300 / 250) = 1.2$ ，第二轮最高分也为 $250$ ,每个人的成绩也要乘 $1.2$ 。
每个人的最终成绩按降序排如下
faebdc 298.20
qmqmqm 295.80
davidwang 275.88
dxy 271.80
lavender 260.64
dxymeizi 233.40
davidlee 220.80
evensgn 201.00
tpkuangmo 29.88
guncuye 14.40
有女选手参加，最佳女选手lavender进入省队，其他分最高的 $7$ 人按名次排列进入省队

第二组数据：有女选手参加，最佳女选手dxymeizi进

/****************************************************/

出题人的解题思路：

SDOI

By davidlee1999WTK

直接按照题意计算出最后每名选手的最终得分，接着按最终得分排序。

先找出来一个得分最高的女生，然后找出其余的选手中得分最高的 $m - 1$ 个人，把所有进入省队的选手再按分数重新排一下序，最后输出即可。

其实此题就是题目长了一点，处理起来麻烦了一点，其他都还好

正如上述所说，我们得先求出每个选手的最终得分

首先，我们得先分别找到两场比赛Round1、Round2最高的原始得分Max1、Max2，每位选手最终得分的公式为

0.3*r1*(300/Max1)+0.7*r2*(300/Max2)

求出所有选手的最终得分之后排序处理就可以了

如果有女生参加，m个人中就需至少包括得分最高的女生，否则输出得分最高的前m个人

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<queue>
#include<stack>
#include<math.h>
#include<vector>
#include<map>
#include<set>
#include<cmath>
#include<string>
#include<algorithm>
#include<iostream>
#define exp 1e-10
using namespace std;
const int N = 105;
const int inf = 1000000000;
const int mod = 2009;
struct person
{
    char name[30],sex[20];
    int r1,r2;
    double score;
}s[N];
bool cmp1(person x,person y)
{
    if(strcmp(x.sex,y.sex)!=0)
        return strcmp(x.sex,y.sex)<0;
    return x.score>y.score;
}
bool cmp2(person x,person y)
{
    return x.score>y.score;
}
int main()
{
    int t,n,m,i,k;
    double Max1,Max2;
    bool v;
    scanf("%d",&t);
    while(t--)
    {
        Max1=Max2=0;
        k=0;
        scanf("%d%d",&n,&m);
        for(i=1;i<=n;i++)
        {
            scanf("%s%s%d%d",s[i].name,s[i].sex,&s[i].r1,&s[i].r2);
            if(Max1<s[i].r1)
                Max1=s[i].r1;
            if(Max2<s[i].r2)
                Max2=s[i].r2;
            if(s[i].sex[0]=='f')
                k++;
        }
        //printf("%d %lf %lf\n",k,Max1,Max2);
        Max1=300/Max1;
        Max2=300/Max2;
        for(i=1;i<=n;i++)
        {
            s[i].score=0.3*s[i].r1*Max1+0.7*s[i].r2*Max2;
            //printf("%lf\n",s[i].score);
        }
        sort(s+1,s+n+1,cmp1);
        printf("The member list of Shandong team is as follows:\n");
        if(k>0)
        {
            sort(s+2,s+n+1,cmp2);
            for(v=true,i=2;i<=m;i++)
            {
                if(v&&s[1].score>s[i].score)
                {
                    printf("%s\n",s[1].name);
                    v=false;
                }
                printf("%s\n",s[i].name);
            }
            if(v)
                printf("%s\n",s[1].name);
        }
        else
        {
            sort(s+1,s+n+1,cmp2);
            for(i=1;i<=m;i++)
                printf("%s\n",s[i].name);
        }
    }
    return 0;
}

菜鸟成长记