제출 #1177800

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1177800		tamzid	Table Tennis (info1cup20_tabletennis)	C++20	0 / 100	9 ms	836 KiB

tabletennis

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using ll = long long;
#define pb push_back
#define F first
#define S second
#define vii vector<int>
#define vl vector<long long>
#define cinv(v)  for (auto &it : v) cin >> it;
#define coutv(v) for (auto &it : v) cout << it << " "; cout << endl;
using namespace std;
//using namespace __gnu_pbds;
//template<class T> using ordset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

void solve()
{
  int n,k;
  cin>>n>>k;
  vii v(n+k);
  cinv(v);
  if(v[0]==v[1])
  {
    cout<<v[0]<<' '<<v[1];
  }
  else if(v[0]==v[2])
  {
    cout<<v[0]<<' '<<v[2];
  }
  else if(v[1]==v[2])
  {
    cout<<v[1]<<' '<<v[2];
  }
}

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

    //int t;cin>>t;while(t--)
        solve();

    return 0;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 9
• Subtask 3: 0 / 14
• Subtask 4: 0 / 15
• Subtask 5: 0 / 9
• Subtask 6: 0 / 14
• Subtask 7: 0 / 15
• Subtask 8: 0 / 13