Cod sursa(job #1926619)
| Utilizator |  Sarmasag Rares rares9301 |
Data | 14 martie 2017 15:46:44 |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
int a[500023];
int n;
int comp(const int &a,const int &b)
{
return a>b;
}
int main()
{
freopen ("algsort.in","r",stdin);
freopen ("algsort.out","w",stdout);
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
sort(a+1,a+n+1,comp);
for(int i=n;i>=1;i--) printf("%d ",a[i]);
}