fork download
copy 
  1. #include <iostream>
  2. #include <algorithm>
  3. using namespace std;
  4. bool comp(int a,int b){
  5. 	return a>b;
  6. }
  7. bool comp1(int a,int b){
  8. 	return a%10<b%10;
  9. }
  10. bool comp2(double a,double b){
  11. 	return ((int)(a*100))%100>((int)(b*100))%100;
  12. }
  13. int main() {
  14.     int n;
  15.     cin>>n;
  16.     int *arr=new int[n];
  17.     for (int i = 0; i < n; ++i) {
  18.         cin>> arr[i];
  19.     }
  20.      for (int i = 0; i < n; ++i) {
  21.         cout << arr[i] << " ";
  22.     }
  23.     cout<<endl;
  24.     sort(arr, arr + n,comp); // сортування масиву від arr[0] до arr[5]
  25.     for (int i = 0; i < n; ++i) {
  26.         cout << arr[i] << " ";
  27.     }
  28.     cout<<endl;
  29.     sort(arr, arr + n,comp1); // сортування масиву від arr[0] до arr[5]
  30.     for (int i = 0; i < n; ++i) {
  31.         cout << arr[i] << " ";
  32.     }
  33.  
  34.     double *y=new double[n];
  35.     for (int i = 0; i < n; ++i) {
  36.         cin>> y[i];
  37.     }
  38.      for (int i = 0; i < n; ++i) {
  39.         cout << y[i] << " ";
  40.     }
  41.     cout<<endl;
  42.     sort(y,y+n,comp2);
  43.     for (int i = 0; i < n; ++i) {
  44.         cout << y[i] << " ";
  45.     }
  46.  
  47.     return 0;
  48. }
  49.  
Success #stdin #stdout 0s 5348KB
comments (?)
stdin
copy 
10
-3 2 6 45 11 34 64 3 3 6345 
4.6 9.756 7.644 4.999 1100.01 7.54 8.765 0.975 9.9 10.1
stdout
copy 
-3 2 6 45 11 34 64 3 3 6345 
6345 64 45 34 11 6 3 3 2 -3 
-3 11 2 3 3 64 34 6345 45 6 4.6 9.756 7.644 4.999 1100.01 7.54 8.765 0.975 9.9 10.1 
4.999 0.975 9.9 8.765 9.756 7.644 4.6 7.54 10.1 1100.01
https://ideone.com/kDSma5
language:
C++ (gcc 8.3)
created:
1 day ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!