hdu4268 Alice and Bob 长春网络赛

Alice and BobTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 406 Accepted Submission(s): 161


Problem DescriptionInputOutputSample InputSample OutputSourceRecommend#include<iostream>#include<cstdlib>#include<stdio.h>#include<vector>#include<set>#include<algorithm>#include<map>using namespace std;typedef pair<int,int>qiqi;vector<qiqi>a,b;multiset<int>c;multiset<int>::iterator it;int main(){ int t,n; scanf("%d",&t); while(t--) { scanf("%d",&n); a.clear();b.clear(); int h,w; for(int i=0;i<n;i++) { scanf("%d%d",&h,&w); a.push_back(make_pair(h,w)); } for(int i=0;i<n;i++) { scanf("%d%d",&h,&w); b.push_back(make_pair(h,w)); } sort(a.begin(),a.end()); sort(b.begin(),b.end()); int ans=0; c.clear(); int j=0; for(int i=0;i<a.size();i++) { while(j<b.size()&&b[j].first<=a[i].first) { c.insert(b[j].second); j++; } it=c.upper_bound(a[i].second); if(it!=c.begin()&&!c.empty()) { it--; c.erase(it); ans++; } } printf("%d\n",ans); }}