Submission

Score: 0

User: Bunkoblong

Problemset: กองชาม

Language: cpp

Time: 1.095 second

Submitted On: 2025-10-01 23:30:30

#include <iostream>
using namespace std;

int main() {
    int n, arr[100000], pile[100000], cnt = 0;
    cin >> n;
    
    for (int i = 0; i < n; i++) cin >> arr[i];
    
    for (int i = 0; i < n - 1; i++) {
        for (int j = i + 1; j < n; j++) {
            if (arr[i] > arr[j]) {
                int a = arr[i];
                arr[i] = arr[j];
                arr[j] = a;
            }
        }
    }

    for (int i = 0; i < n; i++) {
        int b = 0;
        for (int j = 0; j < cnt; j++) {
            if (pile[j] <= arr[i]) {
                pile[j] = arr[i];
                b = 1;
                break;
            }
        }
        if (!b) pile[cnt++] = arr[i];
    }
    cout << cnt << "\n";
}