fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int              long long int
  4. #define double           long double
  5. #define print(a)         for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14.     int x = 1;
  15.     a %= mod;
  16.     while (b) {
  17.         if (b & 1) x = (x * a) % mod; 
  18.         a = (a * a) % mod;
  19.         b >>= 1;
  20.     }
  21.     return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. vector<int> a;
  31. vector<int> b;
  32.  
  33. int consistency(int n){
  34.  
  35.     vector<int> a_pos, a_neg;
  36.     for(int i=0; i<n; i++){
  37.         if(a[i] >= 0) a_pos.push_back(abs(a[i]));
  38.         else a_neg.push_back(abs(a[i]));
  39.     }
  40.  
  41.     vector<int> b_pos, b_neg;
  42.     for(int i=0; i<n; i++){
  43.         if(b[i] >= 0) b_pos.push_back(abs(b[i]));
  44.         else b_neg.push_back(abs(b[i]));
  45.     }
  46.  
  47.     sort(begin(a_pos), end(a_pos));
  48.     sort(begin(a_neg), end(a_neg));
  49.  
  50.     sort(begin(b_pos), end(b_pos));
  51.     sort(begin(b_neg), end(b_neg));
  52.  
  53.  
  54.     int ct1 = 0;
  55.     int i = 0, j = 0;
  56.     while(i<a_pos.size() && j<b_neg.size()){
  57.         if(a_pos[i] < b_neg[j]){
  58.             ct1++;
  59.             i++;
  60.             j++;
  61.         }
  62.         else j++;
  63.     }
  64.  
  65.  
  66.     int ct2 = 0;
  67.     i = 0, j = 0;
  68.     while(i<b_pos.size() && j<a_neg.size()){
  69.         if(b_pos[i] < a_neg[j]){
  70.             ct2++;
  71.             i++;
  72.             j++;
  73.         }
  74.         else j++;
  75.     }
  76.  
  77.     return ct1+ct2;
  78. }
  79.  
  80.  
  81.  
  82.  
  83.  
  84.  
  85.  
  86.  
  87.  
  88.  
  89.  
  90.  
  91.  
  92.  
  93.  
  94. int practice(int n){
  95.  
  96.  
  97.     return 0;
  98. }
  99.  
  100.  
  101.  
  102.  
  103.  
  104. void solve() {
  105.  
  106.     int n;
  107.     cin>> n;
  108.  
  109.     a.resize(n);
  110.     b.resize(n);
  111.     for(int i=0; i<n; i++) cin >> a[i];
  112.     for(int i=0; i<n; i++) cin >> b[i];
  113.  
  114.     cout << consistency(n) << endl;
  115.  
  116.  
  117. }
  118.  
  119.  
  120.  
  121.  
  122.  
  123. int32_t main() {
  124.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  125.  
  126.     int t = 1;
  127.     cin >> t;
  128.     while (t--) {
  129.         solve();
  130.     }
  131.  
  132.     return 0;
  133. }
Success #stdin #stdout 0.01s 5280KB
comments (?)
stdin
copy 
2
2
-1800 -2200
1900 1800
7 
-1900 -2000 -2500 1500 1600 2500 -2500
1800 -1550 2200 -1550 2100 -2500 -1700
stdout
copy 
1
5
https://ideone.com/lVxGXm
language:
C++14 (gcc 8.3)
created:
2 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!