#include <stdio.h>
#include <string.h>


long double f;

struct water
{
	int type;  //0 for chocolate and 1 for coffee
	long double n; //quantity
	long t;  //time
};

water  a[101],tempwater;
long q[101];

int na,nq,ia,iq,i,j,k,temp;
long t;
long double n;

char *s;
int main()
{
	s=new char[20];
	na=nq=0;

	
	while (scanf("%s",s)!=EOF)
	{
		if (strcmp(s,"Query")==0)
		{
			scanf("%ld",&t);
			q[++nq]=t;
		}
		if (strcmp(s,"Chocolate")==0)
		{
			na++;
			scanf("%ld",&t);
			scanf("%lf",&n);
			a[na].type=0;
			a[na].t=t;
			a[na].n=n;
		}
		if (strcmp(s,"Coffee")==0)
		{
			na++;
			scanf("%ld",&t);
			scanf("%lf",&n);
			
			
			a[na].type=1;
			a[na].t=t;
			a[na].n=n;
		}
		
	}//input


	for (i=1;i<nq;i++)
	{
		k=i;
		for (j=i+1;j<=nq;j++)
			if (q[k]>q[j]) k=j;
		temp=q[k];q[k]=q[i];q[i]=temp;

	}
			

	for (i=1;i<na;i++)
	{
		k=i;
		for (j=i+1;j<=na;j++)
			if (a[k].t>a[j].t) k=j;
		tempwater=a[k];
		a[k]=a[i];
		a[i]=tempwater;
	}//sort


	ia=iq=1;
	f=0;
	for (iq=1;iq<=nq;iq++)
	{
		f=0;
		for (ia=1;a[ia].t<=q[iq] && ia<=na;ia++)
		{
			t=q[iq]-a[ia].t;
			if (a[ia].type==1) f+=2*a[ia].n-(long double)t*t/79;
			else f+=8*a[ia].n-(long double)t/12;
		}
		if (f<=1.0) f=1;
		printf("%ld ",q[iq]);
		printf("%.1f\n",f);
	}

	

	return 0;
}

• Negative numbers provided by these formulae indicate the substance's effects have worn off and should not be considered. (1558) mostleg 2005-08-01 16:30:51
• Re:我把程序贴出来，大家帮我看看是什么问题哈！谢谢！ (47) yjn 2005-08-01 16:52:22
  • q开小了，好像要10000吧 (51) mostleg 2005-08-01 17:00:12
    • Re:q开小了，好像要10000吧 (22) yjn 2005-08-01 17:17:26
      • 把排序什么的都写成qsort（）整齐又规范，你那个insertsort()不安全 (26) sunmoonstar_love 2005-08-01 17:19:43
        • Re:把排序什么的都写成qsort（）整齐又规范，你那个insertsort()不安全 (51) yjn 2005-08-01 17:23:54
          • 我们用了3个qsort (55) sunmoonstar_love 2005-08-01 17:26:06