#include<iostream>
#include<algorithm>

using namespace std;

main()
{
      int t,temp;
      int num[10000];
      int flag;
      
      while(cin>>t)
      {
            for(int i=0;i<t;i++)
            {
                    cin>>num[i];
            }
            for(int i=0;i<t;i++){
                    flag=0;
                    for(int j=1;j<t;j++)
                            if(num[j]<num[j-1]){
                                                swap(num[j],num[j-1]);
                                                flag++;
                                                }
                    if(flag==0)break;
            }
            
            if(t%2==1)cout<<"A="<<num[((t+1)/2)-1]<<endl;
            if(t%2==0){
                            temp=num[(t/2)-1];
                            cout<<"A="<<temp;
                            temp++;
                            while(temp<=num[(t/2)])
                            {
                                  cout<<"、"<<temp;
                                  temp++;
                            }
                            cout<<endl;
                      }
      }
      
     
      return 0;
      }
                      

該如何讓程式加速

問題是出在排序嗎??

我幫你測試過換了一種排序就過了

如果加上優化輸入可以更快