Cod sursa(job #741368)
Utilizator | Poenar Liana bia.lili | Data | 25 aprilie 2012 21:51:01 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
bool cmp (int i, int j)
{if(i<j);
return 1;
return 0;}
int main()
{
long long a[5000001];
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;}