JXNVCE ALGO-LOG YouJin Jung

BOJ-7568

#include <iostream>
#include <cmath>
using namespace std;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(NULL); cout.tie(NULL);

	int n;
	int arr[51][2] = {};
	int result[51];
	cin >> n;
  
	for (int i=0; i<n; i++) {
		cin >> arr[i][0] >> arr[i][1];
		result[i] = 1;	
	}

	for (int i=0; i<n; i++) 
		for (int j=0; j<n; j++) 
			if (arr[i][0]<arr[j][0] && arr[i][1]<arr[j][1]) result[i]=result[i]+1;
	
	for (int i=0; i<n; i++) cout << result[i] << " ";
	cout << endl;
    return 0;
}

image

내일 워크샵 발표…라는 핑계로, 잘 안풀려서 구글링을 했다… 얼른 다시 연습하자 ㅜㅜ