Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //Задание 3. Упорядочить элементы массива по убыванию модулей элементов
- #include <algorithm>
- #include <cmath>
- #include <iostream>
- #include <vector>
- using namespace std;
- int main() {
- size_t numbers_count;
- cin >> numbers_count;
- vector<int> numbers(numbers_count);
- for (auto& number : numbers) {
- cin >> number;
- }
- sort(numbers.begin(), numbers.end(), [](const auto& lhs, const auto& rhs) {
- return abs(lhs) > abs(rhs);
- });
- for (auto& number : numbers) {
- cout << number << ' ';
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement