Advertisement
zhukov000

Untitled

Jan 5th, 2020
209
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.12 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2.  
  3. using namespace std;
  4.  
  5. struct Team
  6. {
  7.   int id, s, t;
  8.   Team(int pid, int ps, int pt): id(pid), s(ps), t(pt) {}
  9. };
  10.  
  11. bool less_result(const Team & a, const Team & b)
  12. {
  13.   return a.s > b.s || (a.s == b.s && a.t < b.t);
  14. }
  15.  
  16. int main() {
  17.   freopen("INPUT.TXT", "r", stdin);
  18.   ios_base::sync_with_stdio(false);
  19.   cin.tie(0);
  20.   int n, m, id, am, t; cin >> n >> m;
  21.   vector< Team > data;
  22.   for (int i = 0; i < n; ++i) {
  23.     cin >> id >> am >> t;
  24.     if (am > 0) data.push_back( Team(id, am, t) );
  25.   }
  26.   sort(data.begin(), data.end(), less_result);
  27.   int mx_b = 13;
  28.   int mn_b = 13;
  29.   if ( data.size() > 0 )
  30.   {
  31.       mn_b = mx_b = data[0].s;
  32.       if ( data.size() > 1 )
  33.         mn_b = data[data.size() / 2 - 1].s;
  34.   }
  35.  
  36.   set<int> contestants;
  37.   for(int i = 0; i < (int)data.size() && (data[i].s > mn_b || data[i].s == mx_b); ++i)
  38.   {
  39.     contestants.insert( data[i].id );
  40.   }
  41.  
  42.   for(int i=0; i<m; ++i)
  43.   {
  44.     cin >> id >> am >> t;
  45.     if (am > 0) contestants.insert(id);
  46.   }
  47.   cout << contestants.size() << endl;
  48.   for (auto y: contestants)
  49.     cout << y << " ";
  50.   return 0;
  51. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement