oj.uz

Submission #924783

# Submission time Handle Problem Language Result Execution time Memory
924783 2024-02-09T16:38:40 Z IUA_Hasin Building 4 (JOI20_building4) C++17
0 / 100
 0 ms 348 KB 
#include <bits/stdc++.h>
 
#define endl                                "\n"
#define finp                                for(int i=0; i<n; i++)
#define fknp                                for(int k=0; k<n; k++)
#define yeap                                cout<<"YES"<<endl
#define nope                                cout<<"NO"<<endl
#define inpintn                             int n; cin>>n
#define inpintarrn                          int arr[n]; for(int i=0; i<n; i++){cin>>arr[i];}
#define inpllarrn                           long long arr[n]; for(int i=0; i<n; i++){cin>>arr[i];}
#define ll                                  long long
#define pb                                  push_back
#define answer                              cout<<ans<<endl
#define INF                                 (ll)(1e18)
 
 
using namespace std;
 
int main ()
{ 
    ll n;
    cin>>n;
    ll arr[2*n];
    ll brr[2*n];
    for(int i=0; i<2*n; i++){
        cin>>arr[i];
    }
    for(int i=0; i<2*n; i++){
        cin>>brr[i];
    }
    ll aa = 2*n;
    sort(arr, arr+aa);
    sort(brr, brr+aa);
    ll a = 0;
    ll b = 0;
    for(int i=0; i<2*n; i++){
        if(a>=n){
            cout<<"B";
            b++;
            // cout<<brr[b]<<endl;
        } else if(b>=n){
            cout<<"A";
            a++;
            // cout<<arr[a]<<endl;
        } else {
            if(arr[a]<brr[b]){
                cout<<"A";
                a++;
                // cout<<arr[a]<<endl;
            } else {
                cout<<"B";
                b++;
                // cout<<brr[b]<<endl;
            }
        }
    }
    // cout<<endl;
    // for(int i=0; i<2*n; i++){
    //     cout << arr[i] << " ";
    // }
    // cout<<endl;
    // for(int i=0; i<2*n; i++){
    //     cout << brr[i] << " ";
    // }
    
    
    
    return 0;
 
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -