CodeChef::TSORT

 

#include <iostream>
#include <bits/stdc++.h>
using namespace std ;

int main (){
int t ;
cin >> t ;
int n[t] ;
for (int i = 0; i < t; ++i) {
cin >> n[i];
}
int p = sizeof(n)/sizeof(n[0]) ;
sort(n, n+p ) ;
for (int i = 0; i < t; ++i) {
cout << n[i] << '\n' ;

}
return 0 ;
}

Comments

Popular posts from this blog

CodeChef::CSUB

Atcoder Educational Dp contest :: C vacation

How Recursion Works?