Cod sursa(job #473041)
| Utilizator | Data | 27 iulie 2010 19:19:59 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
unsigned int n, value;
vector<unsigned int> v;
vector<unsigned int>::iterator iter;
ifstream f("algsort.in");
ofstream g("algsort.out");
f >> n;
for( int i = 0; i < n; i++ )
{
f >> value;
v.push_back( value );
}
sort( v.begin(), v.end() );
for( iter = v.begin(); iter != v.end(); iter++ )
g << *iter << " ";
g << "\n";
f.close();
g.close();
return EXIT_SUCCESS;
}