제출 #1173518

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1173518		qrn	Pilot (NOI19_pilot)	C++20	0 / 100	5 ms	1096 KiB

pilot

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;

template<class T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define SPEED                     \
    ios_base::sync_with_stdio(0); \
    cin.tie(NULL);                \
    cout.tie(NULL);

#define pb push_back
#define ins insert
#define fi first
#define se second

#define endl "\n"
#define ALL(x) x.begin(), x.end()
#define sz(x) x.size()
#define intt long long

const intt mod = 1e9 + 7;
const intt base = 31;
const intt inf = 1e9;
const intt mxN = 1e3 + 5;
const intt L = 21;

void solve() {
    intt n;
    cin >> n;
    vector<intt> a(n);
    for(intt i = 0; i < n; i++) {
        cin >> a[i];
    }
    
    ordered_multiset<intt> mst, cmst;
    
    mst.insert(1);
    mst.insert(2);
    mst.insert(2);
    mst.insert(2);
    cout << mst.order_of_key(2) << endl;
}

signed main() {
    SPEED;
    intt tst = 1;
    // cin >> tst;
    while (tst--) {
        solve();
    }
}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 10
• Subtask 3: 0 / 12
• Subtask 4: 0 / 15
• Subtask 5: 0 / 5
• Subtask 6: 0 / 9
• Subtask 7: 0 / 14
• Subtask 8: 0 / 10
• Subtask 9: 0 / 11
• Subtask 10: 0 / 11