HDOJ 5499 SDOI (乱搞)
来源:互联网 发布:学语言的软件 编辑:程序博客网 时间:2024/06/05 06:39
SDOI
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 677 Accepted Submission(s): 268
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 is300 .
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 isx .(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 as0.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.
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
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
After we got everyone's final mark in both round.We calculate the Ultimate mark of everyone as
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 integersn 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 withn lines,each line is an information of a person. Name(A string with length less than20 ,only contain numbers and English letters),Sex(male or female),the Original mark of Round1 and Round2 (both equal to or less than300 ) separated with a space.
For each testcase, there are two integers
Output
For each testcase, output "The member list of Shandong team is as follows:" without Quotation marks.
Followedm lines,every line is the name of the team with their Ultimate mark decreasing.
Followed
Sample Input
210 8dxy male 230 225davidwang male 218 235evensgn male 150 175tpkuangmo female 34 21guncuye male 5 15faebdc male 245 250lavender female 220 216qmqmqm male 250 245davidlee male 240 160dxymeizi female 205 1902 1dxy male 300 300dxymeizi female 0 0
Sample Output
The member list of Shandong team is as follows:faebdcqmqmqmdavidwangdxylavenderdxymeizidavidleeevensgnThe member list of Shandong team is as follows:dxymeiziHintFor 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 followedfaebdc 298.20qmqmqm 295.80davidwang 275.88dxy 271.80lavender 260.64dxymeizi 233.40davidlee 220.80evensgn 201.00tpkuangmo 29.88guncuye 14.40For 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.题意:就不翻译了思路:记录女生最大值,然后排序乱搞就行了ac代码:#include<stdio.h>#include<math.h>#include<string.h>#include<iostream>#include<algorithm>#define MAXN 100010#define LL long long#define INF 0xfffffffusing namespace std;struct s{char name[25];char str[6];int round1;int round2;double sum;}a[MAXN],p;bool cmp(s aa,s bb){return aa.sum<bb.sum;}int main(){int t,n,m,i;scanf("%d",&t);while(t--){scanf("%d%d",&n,&m);int m1=-1,m2=-1;for(i=1;i<=n;i++){scanf("%s%s%d%d",a[i].name,a[i].str,&a[i].round1,&a[i].round2);m1=max(a[i].round1,m1);m2=max(a[i].round2,m2);}double k1=300*1.0/m1;double k2=300*1.0/m2;p.sum=-1.0;int k=0;for(i=1;i<=n;i++){ a[i].sum=a[i].round1*k1*0.3+a[i].round2*k2*0.7; if(strlen(a[i].str)==6) { if(a[i].sum>p.sum) p=a[i]; k++;} }sort(a+1,a+n+1,cmp);int q=n;printf("The member list of Shandong team is as follows:\n");if(k>0)//存在女生{int bz=0;m--;while(m){if(strcmp(a[q].name,p.name)==0)bz=1;printf("%s\n",a[q].name);m--;q--;}if(bz==0)printf("%s\n",p.name);elseprintf("%s\n",a[q].name);}else{while(m){printf("%s\n",a[q].name);m--;q--;}}}return 0;}
0 0
- HDOJ 5499 SDOI (乱搞)
- hdoj 5499 SDOI 【拼手速】
- HDOJ 5499 SDOI
- hdoj 5499 SDOI
- HDOJ 5499 SDOI(结构体排序)
- hdoj 5499--SDOI【结构体排序】
- HDOJ 5499 SDOI 【结构体排序】
- hdoj 5499 SDOI 【结构体排序】
- 【BZOJ】 2049 SDOI洞穴探险 【乱搞】
- 5499 SDOI
- HDOJ 4696 Answers 乱搞
- HDOJ 5499 SDOI(典型的翻译题目,处理女生特殊情况的问题)
- [HDOJ 4948] Kingdom [图论+乱搞]
- HDU 5499 SDOI
- HDU 5499 SDOI
- hdu 5499 SDOI(水)
- 杭电5499 SDOI
- HDU 5499:SDOI【排序】
- jQuery Validation Engine 表单验证
- 模块化管理(二)
- Zookeeper配置与详解
- keepalive工作原理 长连接 短连接
- SQL计算两张表的指定列的数量代数和
- HDOJ 5499 SDOI (乱搞)
- 重读《Kotlin For Android》二
- Eclipse SVN 创建分支
- UnityAPI翻译——VRNode
- 兼容实时监测文本框内容的输入
- JavaEE_Mybatis_SpringMVC_Spring_lesson3_注解处理器映射器与适配器以及处理器(Controller)
- 【FastDev4Android框架开发】HorizontalScrollView,Fragment,FragmentStatePagerAdapter打造网易新闻Tab及滑动页面效果(三十六)
- mondodb初识
- 使用spring动态路由切换主从库