hdu 1084 排序

  1. #include <stdio.h>
  2. #include <iostream>
  3. #include <string>
  4. #include <stdlib.h>
  5. using namespace std;
  6. #define mark student
  7. #define que solve
  8. struct	student
  9. {
  10. 	int solve;
  11. 	int time;
  12. 	int grade;
  13. 	int set;
  14. };
  16. int cmp(const void *a, const void *b )
  17. {
  18. 	if((*(student *)a).solve != (*(student *)b).solve)
  19. 		return (*(mark *)b).que-(*(mark *)a).que;
  20. 	return (*(mark *)a).time-(*(mark *)b).time;
  23. }
  25. int main()
  26. {
  27. 	int n;
  28. 	while( ~scanf("%d", &n)	&& n!= -1)
  29. 	{
  30. 		student list[110];
  31. 		student *p[110];
  32. 		int num[6];
  33. 		memset(num, 0, sizeof(num) );
  34. 		for(int i=0; i<n; i++)
  35. 		{
  36. 			int hour, minute, second;
  37. 			scanf("%d %d:%d:%d", &list[i].solve, &hour, &minute, &second);
  38. 			list[i].time = hour*60*60 +minute * 60 +second;
  39. 			num[list[i].solve] ++;
  40. 			list[i].set =i;
  41. 		}
  42. 		qsort(list, n, sizeof(list[0]), cmp);
  43. 		int count =0;
  44. 		for(int i=5; i>=0; i--)
  45. 		{
  46. 			if(i == 0)
  47. 				for(int i=0; i<num[0]; i++)		list[count++].grade = 50;
  48. 			else if(i == 5)
  49. 				for(int i=0; i<num[5]; i++)		list[count++].grade = 100;
  50. 			else
  51. 			{
  52. 				for(int j=1; j<=num[i]; j++)
  53. 				{
  54. 					if(j<=num[i]/2)
  55. 						list[count++].grade = (i+5)*10+5;
  56. 					else
  57. 						list[count++].grade = (i+5)*10;
  58. 				}
  59. 			}
  60. 		}
  63. 		for(int i=0; i<n; i++)
  64. 		{
  65. 			for(int j=0; j<n; j++)
  66. 			{
  67. 				if(list[j].set == i)	printf("%d
", list[j].grade);
  68. 			}
  69. 		}
  70. 		printf("
");
  71. 	}
  72. 	return 0;
  73. }
  75. /*
  76. Problem Description
  77. “Point, point, life of student!”
  78. This is a ballad（歌谣）well known in colleges, and you must care about your score in this exam too. How many points can you get? Now, I told you the rules which are used in this course.
  79. There are 5 problems in this final exam. And I will give you 100 points if you can solve all 5 problems; of course, it is fairly difficulty for many of you. If you can solve 4 problems, you can also get a high score 95 or 90 (you can get the former(前者) only when your rank is in the first half of all students who solve 4 problems). Analogically（以此类推）, you can get 85、80、75、70、65、60. But you will not pass this exam if you solve nothing problem, and I will mark your score with 50.
  80. Note, only 1 student will get the score 95 when 3 students have solved 4 problems.
  81. I wish you all can pass the exam! 
  82. Come on!
  85. Input
  86. Input contains multiple test cases. Each test case contains an integer N (1<=N<=100, the number of students) in a line first, and then N lines follow. Each line contains P (0<=P<=5 number of problems that have been solved) and T（consumed time）. You can assume that all data are different when 0<p.
  87. A test case starting with a negative integer terminates the input and this test case should not to be processed.
  90. Output
  91. Output the scores of N students in N lines for each case, and there is a blank line after each case.
  94. Sample Input
  95. 4
  96. 5 06:30:17
  97. 4 07:31:27
  98. 4 08:12:12
  99. 4 05:23:13
  100. 1
  101. 5 06:30:17
  102. -1
  105. Sample Output
  106. 100
  107. 90
  108. 90
  109. 95
  111. 100
  112. */





附件列表

    【推广】 免费学中医，健康全家人
    原文地址：https://www.cnblogs.com/sober-reflection/p/2594640784ee529175128cc34c9344a0.html