Cod sursa(job #1245604)
| Utilizator | Data | 19 octombrie 2014 17:41:41 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include<fstream>
#include<algorithm>
#include<vector>
using namespace std;
bool comparare(int i, int j)
{
return (i<j);
}
int main()
{
vector<unsigned long>numere;
ifstream f("algsort.in");
ofstream f1("algsort.out");
long n,i,nr;
f>>n;
for (i=1;i<=n;i++)
{
f>>nr;
numere.push_back(nr);
}
sort(numere.begin(),numere.end(),comparare);
for (int i=0;i<n;i++)
f1<<numere.at(i)<<" ";
return 0;
}
