using System;
using System.Collections.Generic;
using System.Linq;
class Program
{
static string InputPattern = "InputX";
static List<string> GetInputList()
{
var WillReturn = new List<string>();
if (InputPattern == "Input1") {
WillReturn.Add("6 3");
WillReturn.Add("8 1");
WillReturn.Add("6 2");
WillReturn.Add("9 3");
WillReturn.Add("1 1");
WillReturn.Add("2 2");
WillReturn.Add("1 3");
WillReturn.Add("4 3");
WillReturn.Add("2 1");
WillReturn.Add("1 2");
//6
//2
//6
}
else if (InputPattern == "Input2") {
WillReturn.Add("2 2");
WillReturn.Add("4208 1234");
WillReturn.Add("3056 5678");
WillReturn.Add("1 2020");
WillReturn.Add("2 2020");
//3056
//4208
}
else {
string wkStr;
while ((wkStr = Console.ReadLine()) != null) WillReturn.Add(wkStr);
}
return WillReturn;
}
struct ABInfoDef
{
internal int A;
internal int B;
}
static List<ABInfoDef> mABInfoList = new List<ABInfoDef>();
struct CDInfoDef
{
internal int C;
internal int D;
}
static List<CDInfoDef> mCDInfoList = new List<CDInfoDef>();
static void Main()
{
List<string> InputList = GetInputList();
int[] wkArr = { };
Action<string> SplitAct = pStr =>
wkArr = pStr.Split(' ').Select(pX => int.Parse(pX)).ToArray();
SplitAct(InputList[0]);
int N = wkArr[0];
foreach (string EachStr in InputList.Skip(1).Take(N)) {
SplitAct(EachStr);
ABInfoDef WillAdd;
WillAdd.A = wkArr[0];
WillAdd.B = wkArr[1];
mABInfoList.Add(WillAdd);
}
foreach (string EachStr in InputList.Skip(1 + N)) {
SplitAct(EachStr);
CDInfoDef WillAdd;
WillAdd.C = wkArr[0];
WillAdd.D = wkArr[1];
mCDInfoList.Add(WillAdd);
}
Solve();
}
class YoujiInfoDef
{
internal int Syozoku;
internal int Rate;
}
static void Solve()
{
// 幼児情報[幼児ID]なDict
var YoujiInfoDict = new Dictionary<int, YoujiInfoDef>();
for (int I = 0; I <= mABInfoList.Count - 1; I++) {
int CurrA = mABInfoList[I].A;
int CurrB = mABInfoList[I].B;
YoujiInfoDict[I + 1] = new YoujiInfoDef() { Syozoku = CurrB, Rate = CurrA };
}
// レートのMultiSet[幼稚園] なDict
var RateMultiSetDict = new Dictionary<int, AVL_Set_MultiSet<int>>();
foreach (YoujiInfoDef EachYoujiInfo in YoujiInfoDict.Values) {
if (RateMultiSetDict.ContainsKey(EachYoujiInfo.Syozoku) == false) {
RateMultiSetDict[EachYoujiInfo.Syozoku] = new AVL_Set_MultiSet<int>();
RateMultiSetDict[EachYoujiInfo.Syozoku].IsMultiSet = true;
}
RateMultiSetDict[EachYoujiInfo.Syozoku].Add(EachYoujiInfo.Rate);
}
foreach (CDInfoDef EachCDInfo in mCDInfoList) {
if (RateMultiSetDict.ContainsKey(EachCDInfo.D) == false) {
RateMultiSetDict[EachCDInfo.D] = new AVL_Set_MultiSet<int>();
RateMultiSetDict[EachCDInfo.D].IsMultiSet = true;
}
}
// 幼稚園ごとの最大レートのMultiSet
var MaxRateMultiSet = new AVL_Set_MultiSet<int>();
MaxRateMultiSet.IsMultiSet = true;
foreach (AVL_Set_MultiSet<int> EachCPP_MultiSet in RateMultiSetDict.Values) {
int Cnt = EachCPP_MultiSet.Count;
if (Cnt > 0) {
MaxRateMultiSet.Add(EachCPP_MultiSet[Cnt - 1]);
}
}
// クエリに回答
var sb = new System.Text.StringBuilder();
foreach (CDInfoDef EachCDInfo in mCDInfoList) {
int CurrC = EachCDInfo.C;
int CurrD = EachCDInfo.D;
int BeforeSyozoku = YoujiInfoDict[CurrC].Syozoku;
int Rate = YoujiInfoDict[CurrC].Rate;
int Cnt1 = RateMultiSetDict[BeforeSyozoku].Count;
int MaxRate1 = RateMultiSetDict[BeforeSyozoku][Cnt1 - 1];
MaxRateMultiSet.Remove(MaxRate1);
RateMultiSetDict[BeforeSyozoku].Remove(Rate);
if (Cnt1 > 1) {
int Cnt2 = Cnt1 - 1;
int MaxRate2 = RateMultiSetDict[BeforeSyozoku][Cnt2 - 1];
MaxRateMultiSet.Add(MaxRate2);
}
int AfterSyozoku = CurrD;
YoujiInfoDict[CurrC].Syozoku = AfterSyozoku;
int Cnt3 = RateMultiSetDict[AfterSyozoku].Count;
if (Cnt3 > 0) {
int MaxRate3 = RateMultiSetDict[AfterSyozoku][Cnt3 - 1];
MaxRateMultiSet.Remove(MaxRate3);
}
RateMultiSetDict[AfterSyozoku].Add(Rate);
int Cnt4 = Cnt3 + 1;
int MaxRate4 = RateMultiSetDict[AfterSyozoku][Cnt4 - 1];
MaxRateMultiSet.Add(MaxRate4);
sb.AppendLine(MaxRateMultiSet[0].ToString());
}
Console.Write(sb.ToString());
}
}
#region AVL_Set_MultiSet
/// <summary>
/// 要素の追加、削除、検索、取得が可能な集合を表します．
/// </summary>
/// <typeparam name="T">優先度付きキュー内の要素の型を指定します．</typeparam>
/// <remarks>内部的にはAVL木によって実装されています．</remarks>
internal class AVL_Set_MultiSet<T>
{
Node root;
readonly IComparer<T> comparer;
readonly Node nil;
/// <summary>
/// 多重集合かどうかを表します．
/// </summary>
internal bool IsMultiSet { get; set; }
internal AVL_Set_MultiSet(IComparer<T> comparer)
{
nil = new Node(default(T));
root = nil;
this.comparer = comparer;
}
internal AVL_Set_MultiSet() : this(Comparer<T>.Default) { }
/// <summary>
/// 要素をコレクションに追加します．
/// </summary>
/// <remarks>この操作は計算量 O(log N) で実行されます．</remarks>
internal bool Add(T v)
{
return insert(ref root, v);
}
/// <summary>
/// v が存在するならコレクションから削除します．
/// </summary>
/// <remarks>この操作は計算量 O(log N) で実行されます．</remarks>
internal bool Remove(T v)
{
return remove(ref root, v);
}
/// <summary>
/// 0-indexed で index 番目の要素をコレクションから取得します．．
/// </summary>
/// <remarks>この操作は計算量 O(log N) で実行されます．</remarks>
internal T this[int index] { get { return find(root, index); } }
internal int Count { get { return root.Count; } }
internal void RemoveAt(int k)
{
if (k < 0 || k >= root.Count) throw new ArgumentOutOfRangeException();
removeAt(ref root, k);
}
/// <summary>
/// このコレクションに含まれる要素を昇順に並べて返します．
/// </summary>
/// <remarks>この操作は計算量 O(N) で実行されます．</remarks>
internal T[] Items
{
get
{
T[] ret = new T[root.Count];
int k = 0;
walk(root, ret, ref k);
return ret;
}
}
private void walk(Node t, T[] a, ref int k)
{
if (t.Count == 0) return;
walk(t.lst, a, ref k);
a[k++] = t.Key;
walk(t.rst, a, ref k);
}
private bool insert(ref Node t, T key)
{
if (t.Count == 0) { t = new Node(key); t.lst = t.rst = nil; t.Update(); return true; }
int cmp = comparer.Compare(t.Key, key);
bool res;
if (cmp > 0)
res = insert(ref t.lst, key);
else if (cmp == 0) {
if (IsMultiSet) res = insert(ref t.lst, key);
else return false;
}
else res = insert(ref t.rst, key);
balance(ref t);
return res;
}
private bool remove(ref Node t, T key)
{
if (t.Count == 0) return false;
int cmp = comparer.Compare(key, t.Key);
bool ret;
if (cmp < 0) ret = remove(ref t.lst, key);
else if (cmp > 0) ret = remove(ref t.rst, key);
else {
ret = true;
var k = t.lst.Count;
if (k == 0) { t = t.rst; return true; }
if (t.rst.Count == 0) { t = t.lst; return true; }
t.Key = find(t.lst, k - 1);
removeAt(ref t.lst, k - 1);
}
balance(ref t);
return ret;
}
private void removeAt(ref Node t, int k)
{
int cnt = t.lst.Count;
if (cnt < k) removeAt(ref t.rst, k - cnt - 1);
else if (cnt > k) removeAt(ref t.lst, k);
else {
if (cnt == 0) { t = t.rst; return; }
if (t.rst.Count == 0) { t = t.lst; return; }
t.Key = find(t.lst, k - 1);
removeAt(ref t.lst, k - 1);
}
balance(ref t);
}
private void balance(ref Node t)
{
int balance = t.lst.Height - t.rst.Height;
if (balance == -2) {
if (t.rst.lst.Height - t.rst.rst.Height > 0) { rotR(ref t.rst); }
rotL(ref t);
}
else if (balance == 2) {
if (t.lst.lst.Height - t.lst.rst.Height < 0) rotL(ref t.lst);
rotR(ref t);
}
else t.Update();
}
private T find(Node t, int k)
{
if (k < 0 || k > root.Count) throw new ArgumentOutOfRangeException();
while (true) {
if (k == t.lst.Count) return t.Key;
else if (k < t.lst.Count) t = t.lst;
else { k -= t.lst.Count + 1; t = t.rst; }
}
}
/// <summary>
/// コレクションに含まれる要素であって、 v 以上の最小の要素の番号を返します。
/// </summary>
/// <remarks>この操作は計算量 O(log N) で実行されます．</remarks>
internal int LowerBound(T v)
{
int k = 0;
Node t = root;
while (true) {
if (t.Count == 0) return k;
if (comparer.Compare(v, t.Key) <= 0) t = t.lst;
else { k += t.lst.Count + 1; t = t.rst; }
}
}
/// <summary>
/// コレクションに含まれる要素であって、 v より真に大きい、最小の要素の番号を返します。
/// </summary>
/// <remarks>この操作は計算量 O(log N) で実行されます．</remarks>
internal int UpperBound(T v)
{
int k = 0;
Node t = root;
while (true) {
if (t.Count == 0) return k;
if (comparer.Compare(t.Key, v) <= 0) { k += t.lst.Count + 1; t = t.rst; }
else t = t.lst;
}
}
private void rotR(ref Node t)
{
Node l = t.lst;
t.lst = l.rst;
l.rst = t;
t.Update();
l.Update();
t = l;
}
private void rotL(ref Node t)
{
Node r = t.rst;
t.rst = r.lst;
r.lst = t;
t.Update();
r.Update();
t = r;
}
// 追加機能 LowerBoundで返したIndが、有効範囲かを判定
internal bool IsValidInd(int pInd)
{
if (pInd < 0) return false;
if (this.Count <= pInd) return false;
return true;
}
class Node
{
internal Node(T key)
{
Key = key;
}
internal int Count { get; private set; }
internal int Height { get; private set; }
internal T Key { get; set; }
internal Node lst, rst;
internal void Update()
{
Count = 1 + lst.Count + rst.Count;
Height = 1 + Math.Max(lst.Height, rst.Height);
}
public override string ToString()
{
return string.Format("Count = {0}, Key = {1}", Count, Key);
}
}
}
#endregion