Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /* I_parcijalni_ispit_2014 Zadatak_7 */
- #include <iostream>
- #include <algorithm>
- #include <deque>
- using std::cin;
- using std::cout;
- using std::endl;
- int Raspon(int A)
- {
- int mini = A % 10;
- int maks = A % 10;
- A /= 10;
- while (A != 0) {
- int temp = A % 10;
- if (temp > maks) maks = temp;
- if (temp < mini) mini = temp;
- A /= 10;
- }
- return maks - mini;
- }
- int main()
- {
- std::deque<int> dek{1223, 2224, 1226};
- std::sort(dek.begin(), dek.end(), [] (int A, int B) { return Raspon(A) > Raspon(B); });
- for (int x : dek) cout << x << " ";
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement