/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 540.0 KiB
#2 Accepted 1ms 540.0 KiB
#3 Wrong Answer 26ms 796.0 KiB
#4 Wrong Answer 24ms 540.0 KiB

Code

#include <bits/stdc++.h>

using namespace std;

bool check(vector<int> a, vector<int> b) {
  sort(a.begin(), a.end());
  sort(b.begin(), b.end());
  int n = a.size();
  int last = b.back(); b.pop_back();
  for (int i = n - 1; i > 1; --i) {
    if (b.back() >= a[i]) return false;
    if (last >= a[i]) return false;
    last = b.back();
    b.pop_back();
  }
  return true;
}

void solve(int cs) {
  int n;
  cin >> n;
  vector<int> a(n), b(n);
  for (auto &i : a) cin >> i;
  for (auto &i : b) cin >> i;
  cout << ((check(a, b) || check(b, a)) ? "Yes\n" : "No\n");
}

int32_t main() {
  cin.tie(0) -> sync_with_stdio(0);
  int t = 1;
  cin >> t;
  for (int i = 1; i <= t; i++) {
    solve(i);
  }
  return 0;
}

Information

Submit By
Type
Submission
Problem
P1193 C. Roy and Peak Array
Contest
Brain Booster #10
Language
C++17 (G++ 13.2.0)
Submit At
2025-06-13 16:47:14
Judged At
2025-06-13 16:47:14
Judged By
Score
5
Total Time
26ms
Peak Memory
796.0 KiB