The War(Zoj 3508)

D - The War

Crawling in process... Crawling failed Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%lld & %llu

Submit Status Practice ZOJ 3508

Description

A war had broken out because a sheep from your kingdom ate some grasses which belong to your neighboring kingdom. The counselor of your kingdom had to get prepared for this war. There are N (1 <= N <= 2500) unarmed soldier in your kingdom and there are M (1 <= M <= 40000) weapons in your arsenal. Each weapon has a weight W (1 <= W <= 1000), and for soldier i, he can only arm the weapon whose weight is between minWi and maxWi ( 1 <= minWi <= maxWi <= 1000). More armed soldier means higher success rate of this war, so the counselor wants to know the maximal armed soldier he can get, can you help him to win this war?

Input

There multiple test cases. The first line of each case are two integers N, M. Then the following N lines, each line contain two integers minWi, maxWi for each soldier. Next M lines, each line contain one integer W represents the weight of each weapon.

Output

For each case, output one integer represents the maximal number of armed soldier you can get.

Sample Input

3 3
1 5
3 7
5 10
4
8
9
2 2
5 10
10 20
4
21

Sample Output

2
0

解题思路

典型的贪新算法。先把所给范围的最大值按照从小到大排列，再把所给的重量从小到大排序，然后尽可能多的枚举。

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
using namespace std;
struct node
{
    int min;
    int max;
} p[2510];
int cmp(struct node a,struct node b)
{
    return a.max<b.max;
}
int main()
{
    int n,m,i,j,count;
    int w[40010];
    while(~scanf("%d %d",&n,&m))
    {
        count=0;
        for(i=0;i<n;i++)
            scanf("%d %d",&p[i].min,&p[i].max);
        for(i=0;i<m;i++)
            scanf("%d",&w[i]);
        sort(p,p+n,cmp);
        sort(w,w+m);
        for(i=0;i<m;i++)
        {
            for(j=0;j<n;j++)
            {
                if(w[i]>=p[j].min&& w[i]<=p[j].max&&w[i]!=-1&&p[j].max!=-1)
                {
                    count++;
                    w[i]=-1;
                    p[j].max=-1;
                }
            }
        }
        printf("%d\n",count);
    }
    return 0;
}