HDOJ 5499 SDOI

SDOI

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 719    Accepted Submission(s): 280

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)

 

Recommend

hujie

大概是我做的最莫名其妙的一道题。几乎同样的代码，我前一天交是wa后一天交A了。

#include<stdio.h>
#include<math.h>
#include<string.h>
#include<algorithm>
using namespace std;
double ss(double a)
{
	int b;
	a=a*100+0.5;
	b=a;
	a=b/100;
	return a;
}
struct people
{
	char id[25];
	char sex[10];
	double s1;
	double s2;
	double s;
}a[1100];
struct wpeople
{
	char id[25];
	char sex[10];
	double s1;
	double s2;
	double s;
}b[1100];
struct md
{
	char id[25];
	double s;
}fina[1100];
double cmps1(people a,people b)
{
	if(a.s1>b.s1)
		return 1;
	return 0;
}
double cmps2(people a,people b)
{
	if(a.s2>b.s2)
		return 1;
	return 0;
}
double cmps(wpeople a,wpeople b)
{
	if(a.s>b.s)
		return 1;
	return 0;
}
double cmpsa(people a,people b)
{
	if(a.s>b.s)
		return 1;
	return 0;
}
double cmpsf(md a,md b)
{
	if(a.s>b.s)
		return 1;
	return 0;
}
int main()
{
	int t,n,m,o;
	int i,k,x;
	double s1m,s2m,y;
	while(~scanf("%d",&t))
	{
		while(t--)
		{
			memset(a,0,sizeof(a));
			memset(b,0,sizeof(b));
			memset(fina,0,sizeof(fina));
			scanf("%d%d",&n,&m);
			for(i=0;i<n;i++)
			{
				getchar();
				scanf("%s%s%lf%lf",a[i].id,a[i].sex,&a[i].s1,&a[i].s2);
			}
			if(m==0)
			printf("The member list of Shandong team is as follows:\n");	
			else
			{
				sort(a,a+n,cmps1);
			s1m=300.0/a[0].s1;
			sort(a,a+n,cmps2);
			s2m=300.0/a[0].s2;
			for(i=0;i<n;i++)
			{
				a[i].s1=a[i].s1*s1m*0.3;
				a[i].s2=a[i].s2*s2m*0.7;
				a[i].s=a[i].s1+a[i].s2;
			}
			for(i=0,k=0;i<n;i++)
			{
				if(a[i].sex[0]=='f')
				{
					strcpy(b[k].id,a[i].id);
					b[k].s=a[i].s;
					k++;
				}
			}
			if(k==0)
			{
				sort(a,a+n,cmpsa);
				for(i=0,k=0;i<n;i++)
				{
					strcpy(fina[k].id,a[i].id);
					fina[k].s=a[i].s;
					k++;
				}
			}
			else
			{
				sort(b,b+k,cmps);
				strcpy(fina[0].id,b[0].id);
				fina[0].s=b[0].s;
				o=m-1;
			
				sort(a,a+n,cmpsa);
				for(i=0,k=1;i<n;i++)
				{
					if(strcmp(fina[0].id,a[i].id)==0);
					else
					{
						strcpy(fina[k].id,a[i].id);
						fina[k].s=a[i].s;
						k++;
					}
			}
			}
			printf("The member list of Shandong team is as follows:\n");
			sort(fina,fina+m,cmpsf);
			for(i=0;i<m;i++)
				printf("%s\n",fina[i].id);
			}	
		}
	}
	return 0;
}

2016.7.19

机缘巧合之下居然又写了一遍这个题。写的代码简单多了而且思路清晰了很多。

贴一下……表示自己有进步（x

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
using namespace std;
double math(int x1,int x2,int mark1,int mark2)
{
	double fm1=1.0*mark1*(300.0/x1);
	double fm2=1.0*mark2*(300.0/x2);
	double sum=0.3*fm1+0.7*fm2;
	return sum;
}
struct Person
{
	char name[25],sex[10];
	int g1,g2;
	double g;
	int flag;
}a[111],final[111];
int cmp1(Person a,Person b)
{
	if(strcmp(a.sex,b.sex)<0)
		return 1;
	if(strcmp(a.sex,b.sex)==0)
		if(a.g>b.g)
			return 1;
	return 0;
}
bool cmp2(Person a,Person b)
{
	return a.g>b.g;
}
int main()
{
	int T;
	scanf("%d",&T);
	while(T--)
	{
		memset(a,0,sizeof(a));
		int G1,G2;
		int n,m,i,j;
		G1=G2=0;
		scanf("%d%d",&n,&m);
		for(i=0;i<n;i++)
		{
			scanf("%s%s%d%d",a[i].name,a[i].sex,&a[i].g1,&a[i].g2);
			if(a[i].g1>G1)
				G1=a[i].g1;
			if(a[i].g2>G2)
				G2=a[i].g2;
		}
		for(i=0;i<n;i++)
			a[i].g=math(G1,G2,a[i].g1,a[i].g2);
		sort(a,a+n,cmp1);
		final[0]=a[0];
		a[0].flag=1;
		sort(a,a+n,cmp2);
		for(i=0,j=1;j<m;i++)
		{
			if(a[i].flag==1) continue;
			final[j]=a[i];
			j++;
		}
		sort(final,final+m,cmp2);
		printf("The member list of Shandong team is as follows:\n");
		for(i=0;i<m;i++)
			printf("%s\n",final[i].name);
	}
	return 0;
}