Submission #1164053

#TimeUsernameProblemLanguageResultExecution timeMemory
1164053santi3223Kralj (COCI16_kralj)C++17
0 / 140
228 ms35484 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vl vector<ll>
#define vs vector<string>
#define vb vector<bool>
#define vc vector<char>
#define ull unsigned long long
#define pll pair<ll, ll>
#define pb push_back
#define fi first
#define se second
#define ff(i, p, x) for(ll i = p; i < x; i++)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define ed "\n"
#define IO ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
ll MOD = 1e9+7;

int main(){
	IO
	ll n;
	cin >> n;
	vl arr(n), p(n), v(n);
	ff(i, 0, n){
		cin >> arr[i];
		arr[i]--;
	}
	ff(i, 0, n){
		cin >> p[i];
	}
	ff(i, 0, n){
		cin >> v[i];
	}
	sort(all(p));
	sort(rall(v));
	set<ll> dwarves(all(p));
	ll c = 0;
	for(ll s : v){
		auto it = dwarves.upper_bound(s);
		if(it != dwarves.end()){
			c++;
			dwarves.erase(it);
		}
	}
	cout << c;
	
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...