Pagini recente » Cod sursa (job #2285889) | Cod sursa (job #967908) | Cod sursa (job #645528) | Cod sursa (job #1113947) | Cod sursa (job #1227367)
/*
algsort infoarena
*/
#include<vector>
#include<string>
#include<string.h>
#include<algorithm>
#include<cstdio>
#include<fstream>
#include<iostream>
#include<ctime>
#include<set>
#include<map>
#include<cmath>
using namespace std;
#define LL long long
#define PII pair<int ,int>
#define PCI pair<char ,int>
#define VB vector <bool>
#define VI vector <int>
#define VC vector <char>
#define WI vector<VI>
#define WC vector<VC>
#define RS resize
#define X first
#define Y second
#define FORN(i,n) for(int i=0;i<n;++i)
#define FOR(i,a,b) for(int i=a;i<=b;++i)
#define FORD(i,a,b) for(int i=a;i>=b;--i)
#define REPEAT do
#define UNTIL(x) while((x))
#define IN_FILE "algsort.in"
#define OUT_FILE "algsort.out"
ifstream f(IN_FILE);
ofstream g(OUT_FILE);
//variables
VI x;
int n;
//other functions
void reading()
{
f >> n;
x.RS(n);
FORN(i, n)
{
f >> x[i];
}
f.close();
}
void solving()
{
sort(x.begin(), x.end());
}
void write_data()
{
FORN(i, n)
{
g<< x[i]<<" ";
}
}
int main()
{
reading();
solving();
write_data();
}