Submission #486875

#	Time	Username	Problem	Language	Result	Execution time	Memory
486875		PoPularPlusPlus	Exhibition (JOI19_ho_t2)	C++17	100 / 100	57 ms	4516 KiB

joi2019_ho_t2

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}

void solve(){
	int n;
	cin >> n;
	int m;
	cin >> m;
	vector<pair<int,int>> v;
	for(int i = 0; i < n; i++){
		int a , b;
		cin >> a >> b;
		v.pb(mp(b,a));
	}
	sv(v);
	reverse(all(v));
	int arr[m];
	for(int i = 0; i < m; i++)cin >> arr[i];
	sa(arr,m);
	reverse(arr,arr+m);
	int ans = 0;
	int j = 0;
	for(int i = 0; i < n && j < m; i++){
		if(arr[j] >= v[i].vs){
			j++;
			ans++;
		}
	}
	cout << ans << '\n';
}

int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
	//int t;cin >> t;while(t--)
	solve();
	return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 40 / 40
• Subtask 3: 50 / 50