Pagini recente » Cod sursa (job #2092201) | Cod sursa (job #1553656) | Cod sursa (job #233556) | Cod sursa (job #2076546) | Cod sursa (job #1315214)
#include <iostream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <set>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <utility>
#include <string>
#include <cstring>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <limits>
#include <sstream>
#include <deque>
#include <bitset>
#include <complex>
#include <functional>
#include <memory>
#include <numeric>
#define x first
#define y second
typedef std::pair<int, int> pii;
using namespace std;
int x[500001], n, black = 0;
int main () {
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif*/
ifstream fin("algsort.in");
ofstream fout("algsort.out");
fin >> n;
for(int i = 0; i < n; i++)
{
fin >> x[i];
}
for(int i = 0; i < n; i++)
for(int j = i + 1; j < n; j++)
if(x[i] > x[j])
swap(x[i], x[j]);
for(int i = 0; i < n; i++)
fout << x[i] << " ";
return 0;
}