Pagini recente » Cod sursa (job #740496) | Profil caraianioana | Cod sursa (job #1962606) | Cod sursa (job #1064911) | Cod sursa (job #1182635)
#include <fstream>
#include <algorithm>
#define val 200
#define NMAX 1005
using namespace std;
int i,j,gigel[NMAX],ionel[NMAX],n,x[NMAX],y[NMAX];
ifstream in("cai.in");
ofstream out("cai.out");
int rez()
{
int win=0;
for(i=1;i<=n;i++)
{x[i]=1;y[i]=1;}
for(i=n;i>0;i--)
{
for(j=n;j>0;j--)
{
if(gigel[i]>ionel[j]&&x[i]&&y[j])
{
win++;x[i]=0;y[j]=0;break;
}
}
}
for(i=n;i>0;i--)
{
for(j=n;j>0;j--)
{
if(gigel[i]==ionel[j]&&x[i]&&y[j])
{
x[i]=0;y[j]=0;break;
}
}
}
for(i=1;i<=n;i++)
{
if(x[i])win--;
}
return win*val;
}
int main()
{
int test;
in>>test;
while(test)
{
in>>n;
for(i=1;i<=n;i++)
in>>gigel[i];
for(i=1;i<=n;i++)
in>>ionel[i];
sort(gigel+1,gigel+n+1);
sort(ionel+1,ionel+n+1);
out<<rez()<<"\n";
test--;
}
return 0;
}