//Sani buyuk Osman Pasa Plevneden cikmam diyor. //FatihSultanMehmedHan //Abdulhamid Han //Bismillahirrahmanirrahim //█▀█─█──█──█▀█─█─█ //█▄█─█──█──█▄█─█▄█ //█─█─█▄─█▄─█─█─█─█ #pragma GCC optimize ("O3") #pragma GCC target ("sse4") #include <bits/stdc++.h> using namespace std; typedef long long lo; typedef pair< lo,lo > PII; #define fi first #define se second #define mp make_pair #define pb push_back #define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) #define FOR for(int i=1;i<=n;i++) #define mid ((start+end)/2) #define ort ((bas+son)/2) const lo MAX = -1000000000000000000; const lo MIN = 1000000000000000000; const lo inf = 1000000000; const lo KOK = 100000; const lo LOG = 30; const lo li = 500005; const lo mod = 1000000007; int n,m,b[li],a[li],k,flag,t; int cev,cev1,vis[10]; string s; vector<PII> v; int main(void){ scanf("%d",&n); FOR{ scanf("%d",&a[i]); v.pb(mp(a[i],1)); } scanf("%d",&m); for(int i=1;i<=m;i++){ scanf("%d",&b[i]); v.pb(mp(b[i],2)); } sort(v.begin(),v.end()); for(int i=0;i<(int)v.size();i++){ if(v[i].fi<=1440)cev++; vis[v[i].se]++; if(i<=1)continue; if(vis[1]==vis[2]+1 && v[i-1].se==1 && v[i].se==1)cev1++; if(vis[1]==vis[2]-1 && v[i-1].se==2 && v[i].se==2)cev1++; } printf("%d\n%d\n",cev,cev1); return 0; }

preokret.cpp: In function 'int main()':
preokret.cpp:42:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
preokret.cpp:44:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&a[i]);
   ~~~~~^~~~~~~~~~~~
preokret.cpp:47:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&m);
  ~~~~~^~~~~~~~~
preokret.cpp:49:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&b[i]);
   ~~~~~^~~~~~~~~~~~