Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- #include<fstream>
- using namespace std;
- ifstream fin("sortcif2.in");
- ofstream fout("sortcif2.out");
- int main()
- {
- int n,i,v[10001],aux,j,inv,a[10001],x;
- fin>>n;
- for(i=1; i<=n; i++)
- fin>>v[i];
- for(i=1; i<=n; i++)
- {
- x=v[i];inv=0;
- while(x!=0)
- {
- inv=inv*10+x%10;
- x=x/10;
- }
- a[i]=inv%10;
- }
- for(i=1; i<=n; i++)
- for(j=i+1; j<=n; j++)
- if(a[i]>a[j])
- {
- aux=a[i];
- a[i]=a[j];
- a[j]=aux;
- aux=v[i];
- v[i]=v[j];
- v[j]=aux;
- }
- for(i=1; i<=n; i++)
- fout<<v[i]<<" ";
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement