제출 #1139163

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

tabletennis

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define FORI(i, n) for(ll i = 0; i < n; i++)
#define FOR(i, n) for(ll i = 1; i <= n; i++)
typedef vector < ll > vl; 
typedef set < ll > setl;
#define ff first
#define ss second    
#define all(v) v.begin(), v.end() 
#define pll pair<ll, ll> 
#define db double
#define nll cout << "\n"
#define nl "\n"
#define sync ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

const ll mod =  1e9 + 7;
const int MAX = 2e5 + 5;
const int imax = 2147483647;
ll n, m, k, q, l, r, x, y, nd;
ll a[MAX], b[MAX], c[MAX];
// ll a, b, c;
void solve(){
    cin >> n >> k;
    FOR(i, n + k)cin >> a[i];
    FOR(i, n)cout << a[i] << " ";
}
signed main(){      
    // freopen("input.txt","r",stdin);
    // freopen("output.txt","w",stdout);
    sync;
    ll t = 1;
    // cin >> t;
    FOR(i, t){
    // cout << "Case #" << i << ": ";
        solve();
    }
}

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