Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int main()
- {
- int t,n,i,j,k,l,c,d,e,sum=0;
- vector<int>a,b;
- cin>>t;
- for(l=1;l<=t;l++)
- {
- cin>>n;
- for(i=0;i<n;i++)
- {
- cin>>c;
- a.push_back(c);
- }
- for(i=0;i<n;i++)
- {
- cin>>c;
- b.push_back(c);
- }
- sort(a.begin(),a.end());
- sort(b.begin(),b.end());
- int ans=0;
- for(i=1;i<=n;i++)
- {
- sum=0;
- for(j=0;j<i;j++)
- {
- if(a[n-i+j]>b[j])
- sum+=2;
- if(a[n-i+j]==b[j])
- sum++;
- }
- ans=max(ans,sum);
- }
- cout<<"Case "<<l<<": "<<sum<<endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement