Pagini recente » Borderou de evaluare (job #928675) | Cod sursa (job #1318027) | Borderou de evaluare (job #2283975) | Borderou de evaluare (job #1318037) | Cod sursa (job #928804)
Cod sursa(job #928804)
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
FILE*fin=fopen("algsort.in","r");
FILE*fout=fopen("algsort.out","w");
int i,j,k,m,l,n,w[500005],a;
vector <int> v;
int main()
{
fscanf(fin,"%d",&n);
for(i=1;i<=n;i++)
v.push_back(fscanf(fin,"%d",&a));
sort(v.begin(),v.end());
for(i=0;i<n;i++)
fprintf(fout,"%d",a);
return 0;
}