Cod sursa(job #1211707)
| Utilizator | Data | 23 iulie 2014 09:53:12 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> v;
vector<int>::iterator it;
int n, i, x;
struct punct {
int a;
int b;
double modul () {
return a*a + b*b;
}
};
int main(){
ifstream fin("algsort.in");
ofstream fout("algsort.out");
fin>>n;
for (i=1;i<=n;i++) {
fin>>x;
v.push_back(x);
}
sort(v.begin(), v.end());
for (it = v.begin(); it!=v.end(); it++)
fout<<*it<<" ";
/*
for (i=0;i<v.size();i++)
fout<<v[i]<<" ";
*/
return 0;
}
