Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- struct Team
- {
- int id, s, t;
- Team(int pid, int ps, int pt): id(pid), s(ps), t(pt) {}
- };
- bool less_result(const Team & a, const Team & b)
- {
- return a.s > b.s || (a.s == b.s && a.t < b.t);
- }
- int main() {
- freopen("INPUT.TXT", "r", stdin);
- ios_base::sync_with_stdio(false);
- cin.tie(0);
- int n, m, id, am, t; cin >> n >> m;
- vector< Team > data;
- for (int i = 0; i < n; ++i) {
- cin >> id >> am >> t;
- if (am > 0) data.push_back( Team(id, am, t) );
- }
- sort(data.begin(), data.end(), less_result);
- int mx_b = 13;
- int mn_b = 13;
- if ( data.size() > 0 )
- {
- mn_b = mx_b = data[0].s;
- if ( data.size() > 1 )
- mn_b = data[data.size() / 2 - 1].s;
- }
- set<int> contestants;
- for(int i = 0; i < (int)data.size() && (data[i].s > mn_b || data[i].s == mx_b); ++i)
- {
- contestants.insert( data[i].id );
- }
- for(int i=0; i<m; ++i)
- {
- cin >> id >> am >> t;
- if (am > 0) contestants.insert(id);
- }
- cout << contestants.size() << endl;
- for (auto y: contestants)
- cout << y << " ";
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement