View Code of Problem 76

#include<iostream>
#include<algorithm>
using namespace std;

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

int main()
{
	int a[10],n;
	for(int i=0;i<9;i++)
	  cin>>a[i];
	
	cin>>a[9];
	
	if(a[8]>a[0])//从小到大 
	{
		sort(a,a+10); 
	 } 
	
	else {
		
		sort(a,a+10,cmp);
	}
	
	for(int i=0;i<10;i++)
	 cout<<a[i]<<endl;
}

Double click to view unformatted code.


Back to problem 76