View Code of Problem 76

#include <iostream>
#include <algorithm>

bool cmp(int a ,int b){
    return a>b;

}

using namespace std;
int main(){

    int a[10]={0};
    int n;
    for(int i=0;i<9;i++) cin>>a[i];
    cin>>a[9];
    if(a[0]<a[8])sort(a,a+10);
    else sort(a,a+10,cmp);

   
    for(int i=0;i<10;i++)cout<<a[i]<<endl;

    return 0;
}