Cod sursa(job #741370)
Utilizator | Poenar Liana bia.lili | Data | 25 aprilie 2012 21:52:33 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
bool cmp(int i, int j)
{
// return i<j;
if(i<j)
return 1;
return 0;
}
int main()
{
long long a[500001];
long long n, i;
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
sort(a+1, a+1+n, cmp);
for(i=1;i<=n;i++)
g<<a[i]<<" ";
g<<"\n";
f.close();
g.close();
return 0;
}