Cod sursa(job #1889115)
| Utilizator | Data | 22 februarie 2017 16:21:57 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
vector <int> a;
void read()
{
int n;
ifstream f("algsort.in");
f >> n;
a.resize(n);
for (int i = 0; i < a.size(); i++)
f >> a[i];
f.close();
}
void write()
{
ofstream f("algsort.out");
for (int i = 0; i < a.size(); i++)
f << a[i] << ' ';
f.close();
}
int main()
{
read();
sort(a.begin(), a.end() );
write();
return 0;
}
