oj.uz

Submission #942044

# Submission time Handle Problem Language Result Execution time Memory
942044 2024-03-10T04:39:53 Z IUA_Hasin Self Study (JOI22_ho_t2) C++17
10 / 100
 191 ms 13908 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
 
using namespace std;

int main ()
{   
    ll n, m;
    cin>>n>>m;

    ll arr[n];
    ll brr[n];

    for(int i=0; i<n; i++){
        cin>>arr[i];
    }

    for(int i=0; i<n; i++){
        cin>>brr[i];
    }

    ll crr[n];
    for(int i=0; i<n; i++){
        ll aaaa = max(arr[i], brr[i]);
        crr[i] = aaaa;
    }
    ll ans = crr[0];

    for(int i=0; i<n; i++){
        ans = min(crr[i], ans);
    }
    cout<<ans<<endl;


    
 
    return 0;
  
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 436 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 188 ms 13148 KB Output is correct
12 Correct 172 ms 13020 KB Output is correct
13 Correct 133 ms 11240 KB Output is correct
14 Correct 121 ms 11088 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 64 ms 8532 KB Output is correct
17 Correct 191 ms 13908 KB Output is correct
18 Correct 163 ms 13164 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 64 ms 8532 KB Output is correct
3 Correct 191 ms 13908 KB Output is correct
4 Correct 163 ms 13164 KB Output is correct
5 Incorrect 1 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 436 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 188 ms 13148 KB Output is correct
12 Correct 172 ms 13020 KB Output is correct
13 Correct 133 ms 11240 KB Output is correct
14 Correct 121 ms 11088 KB Output is correct
15 Incorrect 1 ms 348 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

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

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 436 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 188 ms 13148 KB Output is correct
12 Correct 172 ms 13020 KB Output is correct
13 Correct 133 ms 11240 KB Output is correct
14 Correct 121 ms 11088 KB Output is correct
15 Incorrect 1 ms 348 KB Output isn't correct
16 Halted 0 ms 0 KB -