Submission

Score: 0

User: Bunkoblong

Problemset: กองชาม

Language: cpp

Time: 0.008 second

Submitted On: 2025-10-01 23:50:34

#include <iostream>
#include <algorithm>
using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    int n, a[100000], p[100000], c = 0;
    cin >> n;
    for (int i = 0; i < n; i++) cin >> a[i];
    
    sort(a, a + n);
    
    for (int i = 0; i < n; i++) {
        int k = 0;
        for (int j = 0; j < c; j++)
            if (p[j] <= a[i]) { p[j] = a[i]; k = 1; break; }
        if (!k) p[c++] = a[i];
    }
    cout << c;
}