179222025-09-23 17:52:58algoproMekk Mester munkái (50 pont)cpp17Wrong answer 7/50111ms6468 KiB
// UUID: 069b1fd1-b026-4c5b-89f9-22ca0623da3d
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, h;
	cin >> n >> h;
	vector<vector<int>> vk(n, vector<int>(3));
	for (int i = 0; i < n; i++) {
		int k, v;
		cin >> k >> v;
		vk[i] = {v, k, i+1};
	}
	sort(vk.begin(), vk.end());
	vector<int> m1, m2;
	int end1 = 0, end2 = 0;
	for (auto i : vk) {
		if (i[1] > end1) {
			m1.push_back(i[2]);
			end1 = i[0];
		} else if (i[1] > end2) {
			m2.push_back(i[2]);
			end2 = i[0];
		}
	}
	cout << m1.size() << " " << m2.size() << endl;
	for (int i : m1) cout << i << " ";
	cout << endl;
	for (int i : m2) cout << i << " ";
	cout << endl;
}
SubtaskSumTestVerdictTimeMemory
base7/50
1Accepted0/01ms316 KiB
2Wrong answer0/09ms956 KiB
3Accepted1/11ms316 KiB
4Accepted1/11ms316 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms316 KiB
7Accepted2/21ms316 KiB
8Wrong answer0/21ms316 KiB
9Accepted3/31ms316 KiB
10Wrong answer0/12ms316 KiB
11Wrong answer0/12ms508 KiB
12Wrong answer0/22ms388 KiB
13Wrong answer0/22ms452 KiB
14Wrong answer0/22ms316 KiB
15Wrong answer0/22ms316 KiB
16Wrong answer0/32ms316 KiB
17Wrong answer0/2101ms5884 KiB
18Wrong answer0/2100ms5880 KiB
19Wrong answer0/4104ms5684 KiB
20Wrong answer0/4104ms5684 KiB
21Wrong answer0/4103ms5840 KiB
22Wrong answer0/4108ms6072 KiB
23Wrong answer0/4111ms6468 KiB