Cod sursa(job #958301)
| Utilizator | Data | 7 iunie 2013 15:44:36 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include<fstream>
#include<algorithm>
#include<vector>
using namespace std;
vector <int> a;
int main()
{
ifstream cin("algsort.in");
ofstream cout("algsort.out");
int i, x, n;
cin>>n;
for(i=1; i<=n; i++)
{
cin>>x;
a.push_back(x);
}
sort( a.begin(), a.end() );
for(vector<int>::iterator it=a.begin(); it!=a.end(); ++it)
{
cout<<*it<<" ";
}
cin.close();
cout.close();
return 0;
}
