Cod sursa(job #2302981)
| Utilizator | Data | 15 decembrie 2018 12:49:00 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <bits/stdc++.h>
#define N 500010
#define b 60000
using namespace std;
char B[b];
int p=b-1;
void inc(){
p++;
if(p==b)
{
fread(B,1,b,stdin);
p=0;
}
}
void read(int &x){
while(B[p]<'0'||B[p]>'9')inc();
x=0;
while(B[p]>='0'&&B[p]<='9'){
x=10*x+B[p]-'0';
inc();
}
}
int main()
{
freopen("algsort.in","r",stdin);
ofstream g("algsort.out");
int n;
read(n);
vector<int> v;
for(int i=1,x;i<=n;i++){
read(x);
v.push_back(x);
}
sort(v.begin(),v.end());
for(auto it:v)g<<it<<' ';
return 0;
}
