Run ID:95869

提交时间:2024-11-02 13:24:44

#include<iostream> using namespace std; int main(){ /** int n,a[200000],temp; cin>>n; for(int i=0;i<n;i++){ cin>>a[i]; } for(int j=1;j<n-1;j++){ for(int i=0;i<n-j;i++){ if(a[i]>a[i+1]){ temp = a[i]; a[i]= a[i+1]; a[i+1] = temp; } } } for(int i=0;i<n;i++){ cout<<a[i]<<" "; } int a[8]={0}; int i,ans =0; for(i = 1;i <=7;i++){ cin>>a[i]; } if(a[1]!=0){ i = 7; while(a[i]==0)i--; if(i==1){ cout<<1<<endl; return 0; }else{ ans+=a[1]*(1+i); } } for(int j =2;j <=7;j++){ ans+=a[j]*j; } cout<<ans<<endl; int a[8]={0},i=0,ans=0; for(int i=1;i<8;i++){ cin>>a[i]; } if(a[1]!=0){ i =7; while(a[i]==0)i--; if(i==1){cout<<1<<endl; return 0; }else{ ans +=a[1] * (i+1); } } for(int j=2;j<8;j++){ ans +=a[j] *j; } cout<<ans<<endl; int a[8],ans=0,i=0; for(int i=1;i<8;i++){ cin>>a[i]; } if(a[1]!=0){ i =7; while(a[i]==0)i--; if(i==0){cout<<1<<endl;return 0; }else{ ans +=a[1]*(i+1); } } for(int j=2;j<8;j++){ ans+=a[j] *j; } cout<<ans; **/ int n[101],k,a[10001]={0},max[101]={0} ,m; cin>>m; for(int h = 1;h<=m;h++){ a[10001]={0}; cin>>n[h]; for(int i =1;i<=n[h];i++){ cin>>k; a[k]++; } for(int j = 1;j<10001;j++){ if(a[j]>max[h]) max[h] = a[j]; } } for(int i=1;i<=m;i++){ if(n[i]%2==0){ if(max[i]<= n[i]/2){ cout<<"Y"<<endl; }else cout<<"N"<<endl; }else { if(max[i] <=n[i]/2+1){ cout<<"Y"<<endl; }else cout<<"N"<<endl; } } return 0; }