Pagini recente » Cod sursa (job #1071960) | Borderou de evaluare (job #2187029) | Cod sursa (job #1451807) | Cod sursa (job #379517) | Cod sursa (job #556881)
Cod sursa(job #556881)
#include<fstream>
#include<algorithm>
#include<time.h>
#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();
clock_t t1,t2;
float sec;
t1=clock();
sortstl(arr);
t2=clock();
float diff ((float)t2-(float)t1);
sec=diff/CLOCKS_PER_SEC;
for(int i=1;i<=n;i++)
g<<arr[i]<<' ';
g<<'\n';
g<<sec<<'\n';
g.close();
return 0;
}