Pagini recente » Borderou de evaluare (job #1505421) | Borderou de evaluare (job #2612089) | Borderou de evaluare (job #2612056) | Borderou de evaluare (job #2617771) | Cod sursa (job #305591)
Cod sursa(job #305591)
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
long i,n,k;
vector<long> x;
int main()
{
in>>n;
for(i=0; i<n; i++)
{in>>k;x.push_back(k);}
sort(x.begin(),x.end());
for(i=0; i<n; i++)
out<<x[i]<<' ';
return 0;
}