补题E题（由你来决定怎么颁奖 ）

So the Beautiful Regional Contest (BeRC) has come to an end! n

students took part in the contest. The final standings are already
known: the participant in the i

-th place solved pi

problems. Since the participants are primarily sorted by the number
of solved problems, then p1≥p2≥⋯≥pn

.Help the jury distribute the gold, silver and bronze medals. Let
their numbers be g

, s

and b

, respectively. Here is a list of requirements from the rules, which
all must be satisfied: for each of the three types of medals, at least
one medal must be awarded (that is, g>0

, s>0

and b>0

); the number of gold medals must be strictly less than the number of
silver and the number of bronze (that is, g<s

and g<b

, but there are no requirements between s

and b

); each gold medalist must solve strictly more problems than any
awarded with a silver medal; each silver medalist must solve strictly
more problems than any awarded a bronze medal; each bronze medalist
must solve strictly more problems than any participant not awarded a
medal; the total number of medalists g+s+b

should not exceed half of all participants (for example, if n=21

, then you can award a maximum of 10

participants, and if n=26

, then you can award a maximum of 13

participants). The jury wants to reward with medals the total maximal
number participants (i.e. to maximize g+s+b

) so that all of the items listed above are fulfilled. Help the jury
find such a way to award medals.InputThe first line of the input
contains an integer t

(1≤t≤10000

) — the number of test cases in the input. Then t

test cases follow.The first line of a test case contains an integer n

(1≤n≤4⋅105

) — the number of BeRC participants. The second line of a test case
contains integers p1,p2,…,pn

(0≤pi≤106

), where pi

is equal to the number of problems solved by the i

-th participant from the final standings. The values pi

are sorted in non-increasing order, i.e. p1≥p2≥⋯≥pn

.The sum of n

over all test cases in the input does not exceed 4⋅105

.OutputPrint t

lines, the j

-th line should contain the answer to the j

-th test case.The answer consists of three non-negative integers g,s,b

. Print g=s=b=0

if there is no way to reward participants with medals so that all
requirements from the statement are satisfied at the same time.
Otherwise, print three positive numbers g,s,b

— the possible number of gold, silver and bronze medals,
respectively. The sum of g+s+b

should be the maximum possible. If there are several answers, print
any of them.

NoteIn the
first test case, it is possible to reward 1 gold, 2 silver
and 3 bronze medals. In this case, the participant solved 5 tasks will
be rewarded with the gold medal, participants solved 4 tasks will be
rewarded with silver medals, participants solved 2 or 3 tasks will be
rewarded with bronze medals. Participants solved exactly 1 task won’t
be rewarded. It’s easy to see, that in this case, all conditions are
satisfied and it is possible to reward participants in this way. It is
impossible to give more than 6 medals because the number of medals
should not exceed half of the number of participants. The answer 1, 3,
2 is also correct in this test case.In the second and third test
cases, it is impossible to reward medals, because at least one medal
of each type should be given, but the number of medals should not
exceed half of the number of participants.

思路：降序排列后，最大值为金牌，统计相同成绩，银牌同样，铜牌统计剩余范围内人数。

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
const int maxn = 400000;
int t;
int n,m;
 int a[maxn];
int main()
{
  cin>>t;
 while(t--){
  
  cin>>n;
  int k=n/2;
  for(int i=1;i<=n;i++)
   cin>>a[i];
  int x=0,y=0,z=0; 
  sort(a+1,a+n+1,greater<int>());//降序排列 
  int i=1;
 while(a[i] == a[1] && i<=k){//相同成绩金牌 
  x++;
  i++;
 }
 int t = a[i];
 while(a[i] == t && i<=k){//相同成绩银牌 
  y++;
  i++;
 }
 while(y <= x && i <= k){//相同数量的金银牌 
  t = a[i];
 while(a[i] == t && i <= k){//相同成绩的铜牌 
  y++;
  i++;}
 } 
 while(a[i] != a[k+1] && i<=k){
  z++;
  i++;
 }
 if(x>=y || x>=z){
  cout<<"0"<<"0"<<"0"<<endl;
  continue;}
 else
  cout<<x<<y<<z<<endl;
 }
}