Booking System

最新推荐文章于 2020-11-21 03:20:16 发布

Mrzhq7

最新推荐文章于 2020-11-21 03:20:16 发布

阅读量455

点赞数

分类专栏：贪心

本文链接：https://blog.csdn.net/Mrzhq7/article/details/80444597

版权

贪心专栏收录该内容

3 篇文章 0 订阅

订阅专栏

Innovation technologies are on a victorious march around the planet. They integrate into all spheres of human activity!

A restaurant called "Dijkstra's Place" has started thinking about optimizing the booking system.

There are n booking requests received by now. Each request is characterized by two numbers: c_i and p_i — the size of the group of visitors who will come via this request and the total sum of money they will spend in the restaurant, correspondingly.

We know that for each request, all c_i people want to sit at the same table and are going to spend the whole evening in the restaurant, from the opening moment at 18:00 to the closing moment.

Unfortunately, there only are k tables in the restaurant. For each table, we know r_i— the maximum number of people who can sit at it. A table can have only people from the same group sitting at it. If you cannot find a large enough table for the whole group, then all visitors leave and naturally, pay nothing.

Your task is: given the tables and the requests, decide which requests to accept and which requests to decline so that the money paid by the happy and full visitors was maximum.

Input

The first line of the input contains integer n (1 ≤ n ≤ 1000) — the number of requests from visitors. Then n lines follow. Each line contains two integers: c_i, p_i(1 ≤ c_i, p_i ≤ 1000) — the size of the group of visitors who will come by the i-th request and the total sum of money they will pay when they visit the restaurant, correspondingly.

The next line contains integer k (1 ≤ k ≤ 1000) — the number of tables in the restaurant. The last line contains k space-separated integers: r₁, r₂, ..., r_k (1 ≤ r_i ≤ 1000) — the maximum number of people that can sit at each table.

Output

In the first line print two integers: m, s — the number of accepted requests and the total money you get from these requests, correspondingly.

Then print m lines — each line must contain two space-separated integers: the number of the accepted request and the number of the table to seat people who come via this request. The requests and the tables are consecutively numbered starting from 1 in the order in which they are given in the input.

If there are multiple optimal answers, print any of them.

Examples

Input

Output

2 130
2 1
3 2

#include<bits/stdc++.h>
using namespace std;
struct node
{
    int m;
    int n;
    int s;
    int d;
}ar[10100];
bool cmp1(node a,node b)
{
    if(a.n!=b.n)  return(a.n>b.n);
    return (a.m<b.m);
}
struct node2
{
    int p;
    int q;
}br[10100];
bool cmp2(node2 a,node2 b)
{
    return(a.p<b.p);
}
int main()
{
    int i,j,k,w,sum1,sum2;
    sum1=sum2=0;
    scanf("%d",&w);
    for(i=1;i<=w;i++)
    {
        scanf("%d%d",&ar[i].m,&ar[i].n);
        ar[i].s=i;
        ar[i].d=0;
    }
    sort(ar+1,ar+i+w,cmp1);
    scanf("%d",&k);
    for(i=1;i<=k;i++)
    {
        scanf("%d",&br[i].p);
        br[i].q=i;
    }
    sort(br+1,br+1+k,cmp2);
    for(i=1;i<=w;i++)
    {
        for(j=1;j<=k;j++)
        {
            if(ar[i].m<=br[j].p)
            {
                sum1++;
                sum2+=ar[i].n;
                ar[i].d=br[j].q;
                br[j].p=0;
                break;
            }
        }
    }
    printf("%d %d\n",sum1,sum2);
    for(i=1;i<=w;i++)
    {
        if(ar[i].d!=0)
        {
            printf("%d %d\n",ar[i].s,ar[i].d);
        }
    }
    return 0;
}

目的使为了使获得最多的钱的数量，所以首先需要对顾客的金钱进行升序排序，顾客的人数可进行排序也可不进行排序，对结果没有太大的影响，必须对桌子进行升序的排序，这样使得最小的桌子优先满足最多钱数的顾客，这样为后面的顾客创造更多大的机会获得桌子，来取得利益的最大化，贪心的思想。