Cod sursa(job #2136623)
| Utilizator | Data | 20 februarie 2018 01:22:08 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include<bits/stdc++.h>
int n,i,v[500000];
char outBuffer[5000000], *p = outBuffer;
void inline itoa(int x)
{
int digits = 1;
for(int i = x; i /= 10; ++digits);
for(int i = digits - 1; ~i; --i)
{
*(p + i) = x % 10 + 48, x /= 10;
}
p += digits; *p++ = 32;
}
main()
{
std::ifstream f("algsort.in");
std::ofstream g("algsort.out");
for(f>>n;i<n;f>>v[i++]);
for(std::sort(v,v+n);i;itoa(v[n-i--]));
puts(outBuffer);
}
