제출 #366575

#제출 시각아이디문제언어결과실행 시간메모리
366575Atill83Kralj (COCI16_kralj)C++14
0 / 140
2088 ms17516 KiB
#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) 3e5+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 timeMemoryGrader output
Fetching results...