博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
G - SDOI
阅读量:4616 次
发布时间:2019-06-09

本文共 4144 字,大约阅读时间需要 13 分钟。

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.

就是一个简单的排序,难得这题直接过了

#include
#include
#include
#include
#include
#include
#include
#define sf scanf#define pf printf#define pb push_back#define mm(x,b) memset((x),(b),sizeof(x))#include
#include
//#define for(i,a,b) for(int i=a;i
b?a:b;}struct qq{ string name; string se; int x1,x2; double score;}a[105];bool cmp(qq a,qq b){ return a.score >b.score;}int main(){ int re; cin>>re; while(re--) { int n,m; cin>>n>>m;int temp=0; int x,y; int Max1=0,Max2=0; for(int i=0;i
>a[i].name>>a[i].se>>a[i].x1>>a[i].x2; if(a[i].se=="female") temp=1; Max1=max(Max1,a[i].x1); Max2=max(Max2,a[i].x2); } for(int i=0;i

转载于:https://www.cnblogs.com/wzl19981116/p/9379944.html

你可能感兴趣的文章
BeanDefinition的Resource定位——2
查看>>
Hibernate之Query.uniqueResult()结果为数值的注意事项
查看>>
学习记事
查看>>
java 子类重写父类的方法应注意的问题
查看>>
[LevelDB] LevelDB理论基础
查看>>
如果部署Excel 加载项?
查看>>
【codecombat】 试玩全攻略 第一关kithguard地牢
查看>>
【DP】 POJ 1191 棋盘分割 记忆化搜索
查看>>
平均要取多少个(0,1)中的随机数才能让和超过1
查看>>
自动化测试 Appium之Python运行环境搭建 Part2
查看>>
说说DBA职责和目标
查看>>
VsCode插件与Node.js交互通信
查看>>
实验报告(实验五)
查看>>
Mysql基本操作
查看>>
末日游戏——杨辉三角+搜索
查看>>
从头认识Spring-2.4 基于java的标准注解装配-@Inject-限定器@Named
查看>>
sql server 实现多表连接查询
查看>>
Python标准库:内置函数getattr(object, name[, default])
查看>>
转:android 自定义RadioButton样式
查看>>
HTTP请求过程
查看>>