Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
34325 | sunhuifeng | 计算鞍点 | C++ | Time Limit Exceeded | 1000 MS | 236 KB | 465 | 2023-12-19 20:57:48 |
#include<iostream> using namespace std; int a[100][100],n; int main(){ cin>>n; for(int i=0;i<n;i++){ for(int j=0;j<n;j++){ cin>>a[i][j]; } } for(int i=0;i<n;i++){ int maxn=-1; int tmp; for(int j=0;i<n;j++){ if(a[i][j]>maxn){ maxn=a[i][j]; int tmp=j; } } int minn=1001; for(int k=0;k<n;k++){ if(a[k][tmp]<minn){ minn=a[k][tmp]; } } if(minn==maxn){ cout<<maxn; } } return 0; }