제출 #1163338

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1163338		ozner77	Kralj (COCI16_kralj)	C++17	56 / 140	371 ms	14348 KiB

kralj

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef map<int,int> mii;
typedef map<ll,ll> mll;
typedef unordered_map<ll,ll> umll;
typedef set<ll> sl;
typedef unordered_set<ll> usl;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vpii> vvpii;
typedef vector<vpll> vvpll;
typedef vector<vvi> vvvi;
typedef vector<vvl> vvvl;
int main(){
    ll n;
    cin>>n;
    vl A;
    vl D;
    vl E;
    for(ll i=0;i<n;i++){
        ll a;
        cin>>a;
        A.pb(a);
    }
    for(ll i=0;i<n;i++){
        ll b;
        cin>>b;
        D.pb(b);
    }
    for(ll i=0;i<n;i++){
        ll c;
        cin>>c;
        E.pb(c);
    }
    sort(rall(D));
    sort(rall(E));
    ll con=0;
    ll con2=0;
    ll c=0;
    while(con<n && con2<n){
        ll act=E[con];
        ll act2=D[con2];
        if(act>act2){
            con++;
            c++;
        }
        con2++;
    }
    cout<<c;
}

• Subtask 1: 56 / 140