hihoCoder太阁最新面经算法竞赛1 register

Ended

Participants:151

Verdict:Wrong Answer
Score:80 / 100
Submitted:2016-05-22 17:20:52

Lang:G++

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
//#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<algorithm>
#include<queue>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
ll mytime[500005];
ll p[500005];
int main() {
    //freopen(".in", "r", stdin);
    ll N, t, a;
    char c;
    cin >> N;
    multiset<ll> price;
    ll count = 0; // 
    ll i = 0; //
    while (N--) {
        cin >> c;
        if (c == 'P') {
            //
            cin >> t >> a;
            mytime[count] = t;
            p[count] = a;
            count++;
            price.insert(a);
        }
        else if (c == 'R') {
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX