#include <iostream> #include <vector> #include <algorithm> int main() { int n; std::cin >> n; std::vector<int> lengths(n); for (int i = 0; i < n; ++i) { std::cin >> lengths[i]; } std::sort(lengths.rbegin(), lengths.rend()); int max_area = 0; for (int h = 1; h <= n; ++h) { int min_length_h = (h <= n) ? lengths[h - 1] : 0; int v = std::min(min_length_h, n - h); std::vector<int> vertical_lengths(lengths.begin() + h, lengths.end()); int count_v = 0; for (int l : vertical_lengths) { if (l >= h) { count_v++; } else { break; } } v = std::min(v, count_v); int area = h * v; if (area > max_area) { max_area = area; } if (v == 0) { break; } } std::cout << max_area << std::endl; return 0; } Сократи код выше

#include <iostream> #include <vector> #include <algorithm>

int main() { int n; std::cin >> n; std::vector<int> lengths(n);

for (int i = 0; i < n; ++i) {
    std::cin >> lengths[i];
}

std::sort(lengths.rbegin(), lengths.rend());
int max_area = 0;

for (int h = 1; h <= n; ++h) {
    int v = std::min(lengths[h - 1], n - h);

    int count_v = std::count_if(lengths.begin() + h, lengths.end(), [h](int l) { return l >= h; });
    
    v = std::min(v, count_v);
    int area = h * v;

    max_area = std::max(max_area, area);

    if (v == 0) {
        break;
    }
}

std::cout << max_area << std::endl;
return 0;

}