kattis/medium/99problems2.cpp at main · dombinks/kattis · GitHub

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
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
#include <iostream>
#include <algorithm>
#include <map>
#include <list>

using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    int max = 1000000001;

    int N, Q;
    cin >> N >> Q;

    map<int, int> seen;

    for(int i = 0; i < N; i++)
    {
        int D;
        cin >> D;

        if(seen.find(D) == seen.end())
        {
            seen[D] = 1;
        }
        else
        {
            seen[D] += 1;
        }
    }

    for(int i = 0; i < Q; i++)
    {
        int T, D;
        cin >> T >> D;

        if(T == 1)
        {
            map<int, int>::iterator it = upper_bound(seen.begin(), seen.end(), D);

            while(it != seen.end())
            {
                if(it->second > 0)
                {
                    it->second--;
                    break;
                }
                else
                {
                    it++;
                }
            }

            if(it == seen.end())
            {
                cout << -1 << endl;
            }
            else
            {
                cout << it->second << endl;
            }
        }

        if(T == 2)
        {
            map<int, int>::iterator it = lower_bound(seen.begin(), seen.end(), D);

            bool found = false;

            while(it != seen.begin())
            {
                if(it->second > 0)
                {
                    it->second--;
                    found = true;
                    break;
                }
                else
                {
                    it--;
                }
            }

            if(it == seen.begin() && it->second > 0)
            {
                it->second--;
                found = true;
            }

            if(found)
            {
                cout << it->second << endl;
            }
            else
            {
                cout << -1 << endl;
            }
        }
    }

    return 0;
}