The War&&贪口算法

The War&&贪心算法

#include<iostream>#include<cstdio>#include<algorithm>#include<string.h>#include<string>#include<set>using namespace std;typedef struct{int x;int y;}Node;Node s[2505];bool cmp(Node a,Node b){return a.y<b.y;}int main(){int n,m;while(~scanf("%d%d",&n,&m)){for(int i=0;i<n;++i)scanf("%d%d",&s[i].x,&s[i].y); sort(s,s+n,cmp); multiset<int>Q;for(int i=1;i<=m;++i) {int a;scanf("%d",&a);Q.insert(a);}int ans=0;multiset<int>::iterator it;for(int i=0;i!=n;++i){it=Q.lower_bound(s[i].x);if(it!=Q.end()&&*it<=s[i].y) ans++,Q.erase(it);}printf("%d\n",ans);}return 0;}