Submission #366576

# Submission time Handle Problem Language Result Execution time Memory
366576 2021-02-14T15:13:45 Z Atill83 Kralj (COCI16_kralj) C++14
56 / 140
1032 ms 35692 KB
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 5e5+5;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n;
int a[MAXN], p[MAXN], v[MAXN];
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);

    #ifdef Local
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt","r",stdin);
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt","w",stdout);
    #endif

    cin>>n;

    for(int i = 1; i <= n; i++){
        cin>>a[i];
    }
    for(int i = 1; i <= n; i++)
        cin>>p[i];

    set<int> st;
    
    for(int i = 1; i <= n; i++){
        cin>>v[i];
        st.insert(v[i]);
    }

    int ans = 0;
    for(int i = 1; i <= n; i++){
        auto u = st.lower_bound(p[i]);
        if(u == st.end())
            st.erase(st.begin());
        else{
            ans++;
            st.erase(u);
        }
    }

    cout<<ans<<endl;

    
    #ifdef Local
        cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}
# Verdict Execution time Memory Grader output
1 Correct 776 ms 31752 KB Output is correct
2 Correct 472 ms 30772 KB Output is correct
3 Correct 572 ms 35052 KB Output is correct
4 Correct 584 ms 35692 KB Output is correct
5 Incorrect 932 ms 31212 KB Output isn't correct
6 Incorrect 562 ms 30204 KB Output isn't correct
7 Incorrect 965 ms 32492 KB Output isn't correct
8 Incorrect 729 ms 27756 KB Output isn't correct
9 Incorrect 1032 ms 33132 KB Output isn't correct
10 Incorrect 856 ms 33772 KB Output isn't correct