[Codeforces Round #317]Order Book

Problem Report

In this task you need to process a set of stock exchange orders and use them to create order book.

An order is an instruction of some participant to buy or sell stocks on stock exchange. The order number i has price pi, direction di — buy or sell, and integer qi. This means that the participant is ready to buy or sell qi stocks at price pi for one stock. A value qi is also known as a volume of an order.

All orders with the same price p and direction d are merged into one aggregated order with price p and direction d. The volume of such order is a sum of volumes of the initial orders.

An order book is a list of aggregated orders, the first part of which contains sell orders sorted by price in descending order, the second contains buy orders also sorted by price in descending order.

An order book of depth s contains s best aggregated orders for each direction. A buy order is better if it has higher price and a sell order is better if it has lower price. If there are less than s aggregated orders for some direction then all of them will be in the final order book.

You are given n stock exhange orders. Your task is to print order book of depth s for these orders.

Sample Input

The input starts with two positive integers n and s (1 ≤ n ≤ 1000, 1 ≤ s ≤ 50), the number of orders and the book depth.

Next n lines contains a letter di (either ‘B’ or ‘S’), an integer pi (0 ≤ pi ≤ 105) and an integer qi (1 ≤ qi ≤ 104) — direction, price and volume respectively. The letter ‘B’ means buy, ‘S’ means sell. The price of any sell order is higher than the price of any buy order.

Sample Output

Print no more than 2s lines with aggregated orders from order book of depth s. The output format for orders should be the same as in input.

Input

6 2
B 10 3
S 50 2
S 40 1
S 50 6
B 20 4
B 25 10

Output

S 50 8
S 40 1
B 25 10
B 20 4

Note

Denote (x, y) an order with price x and volume y. There are 3 aggregated buy orders (10, 3), (20, 4), (25, 10) and two sell orders (50, 8), (40, 1) in the sample.

You need to print no more than two best orders for each direction, so you shouldn’t print the order (10 3) having the worst price among buy orders.

My Problem Report

用map合并相同的操作即可

My Source Code

//  Created by Chlerry in 2015.
//  Copyright (c) 2015 Chlerry. All rights reserved.
//

#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <cstring>
#include <climits>
#include <string>
#include <vector>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;
#define Size 100000
#define ll long long
#define mk make_pair
#define pb push_back
#define mem(array, x) memset(array,x,sizeof(array))
typedef pair<int,int> P;

map<int ,int >a,b;
int n,s,p,q;
string str;
int main()
{   
    // freopen("in.txt","r",stdin);
    cin>>n>>s;
    for(int i=0;i<n;i++)
    {
        cin>>str>>p>>q;
        if(str=="B")
            b[p]+=q;
        else if(str=="S")
            a[p]+=q;
    }
    map<int,int>::iterator iter;
    if(a.size()>0)
    {
        iter=a.begin();
        int m=min((int)a.size(),(int)s);
        for(int i=1;i<=m;i++)
            iter++;
        for(int i=0;i<s;i++)
        {
            iter--;
            printf("S %d %d\n",iter->first,iter->second);
            if(iter==a.begin())
                break;
        }
    }   
    iter=b.end();
    for(int i=0;b.size()>0 && i<s;i++)
    {
        iter--;
        printf("B %d %d\n",iter->first,iter->second);
        if(iter==b.begin())
            break;
    }
    return 0;
}