#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
void ui()
{
    cout << "欢迎进入数组操作系统" << endl;
    cout << "请输入数组大小" << endl;
}
void ui2()
{
    cout << "1.排序" << endl;
    cout << "2.倒置" << endl;
    cout << "3.查找" << endl;
    cout << "4.求和" << endl;
    cout << "5.退出" << endl;
}
void find(vector<int> a,int m, int n)
{
    for(int i = 0; i < n; i++)
    {
        if(a[i] == n)
        {
            cout<<"找到了"<<endl;
                return;
        }
    }
    cout<<"没找到"<<endl;
    return;
}
void sum(vector<int> b, int n)
{
    int sum = 0;
    for(int i = 0; i < n; i++)
        sum += b[i];
    cout<<sum<<endl;
}
int main()
{
    int n, x, t;
    vector<int> coll;
    ui();
    cin >> n;
    cout << "请输入数组元素" << endl;
    for (int i = 0; i < n; i++)
    {
        cin>>x;
        coll.push_back(x);
    }
    ui2();
    while (cin >> t && t != 5)
    {
        if (t == 1)
        {
            sort(coll.begin(), coll.end());
            for(i = 0; i < n; i++)
                cout<<coll[i] << ' ';
            cout<<endl;
        }
        else if (t == 2)
        {
            reverse(coll.begin(),coll.end());
                for(i = 0; i < n; i++)
                cout<<coll[i] << ' ';
                    cout<<endl;
        }
        else if (t == 3)
        {
            int y;
            cin>>y;
            find(coll,y, n);
        }
        else if (t == 4)
        {
            sum(coll,n);
        }   
    }
    return 0;
}