HDU4864: Task (Greedy), hdu4864task greedy

HDU4864: Task (Greedy), hdu4864task greedy
Problem DescriptionToday the company has m tasks to complete. the ith task need xi minutes to complete. meanwhile, this task has a difficulty level yi. the machine whose level below this task's level yi cannot complete this task. if the company completes this task, they will get (500 * xi + 2 * yi) dollars.
The company has n machines. each machine has a maximum working time and a level. if the time for the task is more than the maximum working time of the machine, the machine can not complete this task. each machine can only complete a task one day. each task can only be completed by one machine.
The company hopes to maximize the number of the tasks which they can complete today. If there are multiple solutions, they hopes to make the money maximum.
InputThe input contains several test cases.
The first line contains two integers N and M. N is the number of the machines. M is the number of tasks (1 <= N <= 100000,1 <= M <= 100000 ).
The following N lines each contains two integers xi (0 <xi <1440), yi (0 = <yi <= 100 ). xi is the maximum time the machine can work. yi is the level of the machine.
The following M lines each contains two integers xi (0 <xi <1440), yi (0 = <yi <= 100 ). xi is the time we need to complete the task. yi is the level of the task.
OutputFor each test case, output two integers, the maximum number of the tasks which the company can complete today and the money they will get.
Sample Input

1 2100 3100 2100 1

 
Sample Output

1 50004

 

Question: n machines, m tasks, each machine and task have two values. The two values of the machine are greater than the two values of the task. This machine can complete this task, each machine can only complete one task. The best way of thinking is to be greedy and Mark brute force.

#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;struct node{    int x,y;} s1[100005],s2[100005];int cmp(node a,node b){    if(a.x == b.x)        return a.y>b.y;    return a.x>b.x;}int main(){    int n,m,i,j,cnt;    __int64 sum;    while(~scanf("%d%d",&n,&m))    {        for(i = 0; i<n; i++)            scanf("%d%d",&s1[i].x,&s1[i].y);        for(i = 0; i<m; i++)            scanf("%d%d",&s2[i].x,&s2[i].y);        sort(s1,s1+n,cmp);        sort(s2,s2+m,cmp);        cnt = sum = 0;        int c[105] = {0};        for(i = 0,j = 0; i<m; i++)        {            while(j<n && s1[j].x>=s2[i].x)            {                c[s1[j].y]++;                j++;            }            for(int k = s2[i].y; k<=100; k++)            {                if(c[k])                {                    c[k]--;                    sum+=(s2[i].x*500+s2[i].y*2);                    cnt++;                    break;                }            }        }        printf("%d %I64d\n",cnt,sum);    }}