暴力求解
a[i][j]数组的存储 第i组第j头奶牛的排名
暴力循环每一对检查是否合格
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 25;
int g[N][N];
int main()
{
int k,n;
cin>>k>>n;
//cout<<k<<n<<endl;
for(int i = 1;i <= k;i++){
for(int j = 1;j <= n;j++){
int x;
cin>>x;
g[i][x] = j;
}
}
// for(int i = 1;i <= k;i++){
// for(int j = 1;j <= n;j++){
// cout<<g[i][j]<<" ";
// }
// cout<<endl;
// }
int res = 0;
//假设a的排名比b大
for(int a = 1;a <= n;a++){
for(int b = 1;b <= n;b++){
if(a == b) continue;
bool falg = true;
for(int c = 1;c <= k;c++){
if(g[c][a] > g[c][b]){
falg = false;
break;
}
}
if(falg){
//cout<<a<<" "<<b<<endl;
res++;
}
}
}
cout<<res;
return 0;
}