Pagini recente » Borderou de evaluare (job #1863782) | Borderou de evaluare (job #2653095) | Diferente pentru ghid-adaugare-interactive intre reviziile 10 si 9 | Cod sursa (job #556913)
Cod sursa(job #556913)
#include<fstream>
#include<algorithm>
#define maxn 500010
using namespace std;
int n;
int arr[maxn];
ifstream f("algsort.in");
ofstream g("algsort.out");
void citire(){
f>>n;
for(int i=1;i<=n;i++)
f>>arr[i];
}
void sortstl(int arr[]){
sort(arr+1,arr+n+1);
}
int main(){
citire();
sortstl(arr);
for(int i=1;i<=n;i++)
g<<arr[i]<<' ';
g<<'\n';
g.close();
return 0;
}