Tema 26.11.2018

#include <iostream>
#include <algorithm>

using namespace std;

void Aranjare (int[], int);
void Calcule (int[], int, int&, int&, int&);
int f (int[], int);
void Sterge(int[], int&, int, int);

int main()
{
    int pb; cout<<"Introdu nr. problemei:"<<endl; cin>>pb;
    switch (pb){
        case 1:{//var 19
            int n; cout<<"n="; cin>>n;
            int v[n];
            cout<<"Introdu elementele vecteorului:"<<endl;
            for (int i=0; i<n; i++)
                cin>>v[i];
            cout<<"Vectorul aranjat este:"<<endl;
            Aranjare(v, n);
            for(int i=0; i<n; i++)
                cout<<v[i]<<" ";
            break;
        }
        case 2:{//var 24
            int n; cout<<"n="; cin>>n;
            int v[n];
            cout<<"Introdu elementele vecteorului:"<<endl;
            for (int i=0; i<n; i++)
                cin>>v[i];
            int mini, sum, maxi;
            Calcule(v, n,  maxi,  mini, sum);
            cout<<"Minimul este:"<<mini<<endl;
            cout<<"Maximul este:"<<maxi<<endl;
            cout<<"Suma este:"<<sum<<endl;
            float ma;
            ma=(sum-mini-maxi)*1.0/(n-2)*1.0;
            cout<<"Media aritmetica este:"<<ma<<endl;
            break;
        }

        case 3:{//var 25
            int n; cout<<"n="; cin>>n;
            int v[n];
            cout<<"Introdu elementele vecteorului:"<<endl;
            for (int i=0; i<n; i++)
                cin>>v[i];
            cout<<f(v, n);
            break;
        }
        case 4:{//var 26
            int n; cout<<"n="; cin>>n;
            int v[n];
            cout<<"Introdu elementele vecteorului:"<<endl;
            for (int i=0; i<n; i++)
                cin>>v[i];
            int i, j;
            cout<<"i="; cin>>i;
            cout<<"j="; cin>>j;
            Sterge(v, n, i, j);
            cout<<"Vectorul format este:"<<endl;
            for (int i=0; i<n; i++)
                cout<<v[i]<<" ";
            break;
        }
    }
    return 0;
}


    void Aranjare(int v[], int n){
        sort(v, v+n);
    }


       void Calcule (int v[], int n, int& maxi, int& mini, int& sum){
        sum=0;
        sort(v, v+n);
        maxi=v[n-1];
        mini=v[0];
        for (int i=0; i<n; i++)
            sum+=v[i];
    }

    int f (int v[], int n){
        int k=0;
        for (int i=n-1; i>=0; i--){
            if(v[i]%2==0)
                k=k*10+v[i];
        }
        if(k)
            return k;
        else
            return -1;
    }

    void Sterge (int v[], int& n, int i, int j){
        for(int k=i, m=j; k<j; k++, m++){
            v[k]=v[m];
            n--;
        }
    }