Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- bool myCompare(int x, int y)
- {
- int xy = x, yx = y;
- int counterX = 0, counterY = 0;
- while (x > 0) {
- counterX++;
- x /= 10;
- }
- while (y > 0) {
- counterY++;
- y /= 10;
- }
- x = xy;
- y = yx;
- while (counterX--){
- yx *= 10;
- }
- while (counterY--) {
- xy *= 10;
- }
- yx += x;
- xy += y;
- return xy > yx;
- }
- void arrayAscend(int k, int* arr) {
- int temp, i, j;
- for (i = 0; i < k; i++) {
- for (j = i+1; j < k; j++) {
- if (arr[i] > arr[j]) {
- temp = arr[i];
- arr[i] = arr[j];
- arr[j] = temp;
- }
- }
- }
- for (i = 0; i < k; i++) {
- for (j = i + 1; j < k; j++) {
- if (myCompare(arr[i], arr[j]) == false) {
- int temp1 = arr[i];
- arr[i] = arr[j];
- arr[j] = temp1;
- }
- }
- cout << arr[i] << ' ';
- }
- }
- int main() {
- int k;
- cin >> k;
- int arr[15];
- int i;
- for (i = 0; i < k; i++) {
- cin >> arr[i];
- }
- if ((k < 1 && k > 15) && (arr[i]<1 && arr[i]>9999)) {
- cout << -1;
- }
- else {
- arrayAscend(k, arr);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement