백준 신입 사원

https://www.acmicpc.net/problem/1946

1946번: 신입 사원

음 그리드 문제는 for문 하나로 무조건 해결해야 시간초과가 안나네요. 흐음 이게 제일 어렵네요 

구현은 해도 시간복잡도가 항상  O(N)을 유지해야하네요.

#include <iostream>
#include <vector>
#include <queue>
#include<string>
#include<algorithm>
#include<cmath>
#include<unordered_map>
#include<map>
#include<stack>
using namespace std;

struct Point {
	int s, e, t, cnt, power;
	char c;
};

void Prints(vector<vector<int>>maps, int n, int m) {
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cout << maps[i][j] << " ";
		}
		cout << endl;
	}
	cout << endl;
}

void Prints(vector<vector<bool>>maps, int n, int m) {
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cout << maps[i][j] << " ";
		}
		cout << endl;
	}
	cout << endl;
}
void Prints(vector<vector<char>>maps, int n, int m) {
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cout << maps[i][j];
		}
		cout << endl;
	}
	cout << endl;
}
void Prints(vector<vector<vector<char>>>maps, int n, int m, int k) {
	for (int t = 0; t < k; t++) {
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				cout << maps[t][i][j];
			}
			cout << endl;
		}
		cout << endl;
	}
	cout << endl;
}

void Prints(vector<vector<vector<bool>>>maps, int n, int m, int k) {
	for (int t = 0; t < k; t++) {
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				cout << maps[t][i][j];
			}
			cout << endl;
		}
		cout << endl;
	}
	cout << endl;
}
void Prints(vector<int>line, int n) {
	for (int i = 0; i < n; i++) {
		cout << line[i] << ",";
	}
	cout << endl;
}
void Prints(string str, int n) {
	for (int i = 0; i < n; i++) {
		cout << str[i] << ",";
	}
	cout << endl;
}

bool checkmaps(vector<vector<int>>maps, vector<vector<int>>anw, int n, int m) {
	bool bCheck = false;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			if (maps[i][j] != anw[i][j]) {
				bCheck = true;
				i = n + 1;
				j = m + 1;
				continue;
			}
		}

	}
	return bCheck;

}
bool findstart(vector<vector<int>>maps, vector<vector<int>>anw, int n, int m, int) {
	bool bCheck = false;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			if (maps[i][j] != anw[i][j]) {
				bCheck = true;
				i = n + 1;
				j = m + 1;
				continue;
			}
		}

	}
	return bCheck;

}

struct Data {
	int resume;
	int meeting;
	int id;
	bool bCheck = false;

};
struct GDatas {
	int change;
	int index;
	string times;

};
void Prints(vector<Data>line, int n) {
	for (int i = 0; i < n; i++) {
		cout << line[i].id<<","<<line[i].meeting<<","<<line[i].resume << ","<<endl;
	}
	cout << endl;
}
long long n, m;
int k, x;
vector<vector<int>>glistmaps;
vector<bool>bVisited;
bool resumecmp(const Data &a, const Data &b) {
	
	return a.resume < b.resume;
}
bool meetcmp(const Data &a, const Data &b) {
	
	return a.meeting < b.meeting;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	//
	int T;
	cin >> T;
	vector<int>gCoutnt;
	for (int z = 0; z < T; z++) {
		int n;
		cin >> n;
		vector<Data>initlists;
		vector<Data>lists;
		vector<Data>srlists;
		vector<Data>smlists;
		int gcnt = 0;
		for (int i = 0; i < n; i++) {
			int resume;
			int meeting;
			cin >> resume>>meeting;
			Data d;
			d.id = i;
			d.resume = resume;
			d.meeting = meeting;

			initlists.push_back(d);
		}
		lists=initlists;
		sort(lists.begin(), lists.end(), resumecmp);
		srlists = lists;

		Data min = srlists[0];
		gcnt++;
		for (int i = 0; i < srlists.size(); i++) {
			if (min.meeting > srlists[i].meeting) {
				min = srlists[i];
				gcnt++;
			}
			
		}
		gCoutnt.push_back(gcnt);
	}
	for (int i = 0; i < gCoutnt.size(); i++) {
		cout << gCoutnt[i] << endl;
	}
	
	
	return 0;
}