제출 #17835

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
17835		Erzhann	힘 센 거북 (IZhO11_turtle)	C++98	0 / 100	2099 ms	8172 KiB

turtle

/*
  /\     /\
  | ).|.( |
  |  >-<  |
  =========
It's Adilkhan99 miaaaaaau      
*/
#include<bits/stdc++.h>

#define ll long long
#define pb push_back
#define endl "\n"
#define foreach(it, S) for(__typeof (S.begin()) it = S.begin(); it != S.end(); it++)
#define mp make_pair
#define f first
#define s second 
#define name ""
#define _ ios_base::sync_with_stdio(false);cin.tie(0);

using namespace std;
                                            
const int MaxN = int (2e5) + 256;
const int INF = int(1e9);  
const int mod = (int)(1e9) + 7;
int n, a[MaxN], m, t;
multiset<int> s, S;

int main () { _
	
	cin >> n;
	for(int i = 1; i <= n; i++){
		int x, y; cin >> x >> y;
		if(y == 2)
			S.insert(-x);		
		else s.insert(-x);
		auto I = s.begin();
		auto J = S.begin();
		bool ok = 0, ok1 = 0;
		while(I != s.end() && J != S.end()){
			if(ok && ok1){
				break;
			}
			if(-(*I) > -(*J))
				ok = 1;
			if(-(*I) < -(*J))
				ok1 = 1;
			I++;
			J++;
		}
		cerr << ok << " " << ok1 << endl;
		if(I == s.end() && J != S.end())
			ok1 = 1;
		if(J == S.end() && I != s.end())
			ok = 1;
		if(ok && ok1)
			cout << "?";
		else if(ok)
			cout << ">";
		else cout << "<";
		cout << endl;								
	}	              	
return 0;
}                   									

• Subtask 1: 0 / 100