Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int main()
- {
- int c , r , sedl , ksedl;
- cin >> r >> c;
- int a[r][c];
- ksedl = 0;
- int m = 0;
- int g = 100000;
- int minstr[r];
- int maxcol[c];
- for (int i = 0; i < r;i++){
- for (int j = 0; j < c ;j++){
- cin >> a[i][j];
- }
- }
- for (int i = 0; i < r;i++){
- for (int j = 0; j < c ;j++){
- if (a[i][j] <= g){
- g = a[i][j];
- }
- }
- minstr[i] = g;
- g = 100000;
- }
- int g2 = -10000;
- for (int j = 0; j < r ;j++){
- for (int i = 0; i < c;i++){
- if (a[i][j] >= g2){
- g2 = a[i][j];
- }
- }
- maxcol[j] = g2;
- g2 = -10000;
- }
- for (int i = 0; i < r ;i++){
- for (int j = 0;j < c; j ++){
- if (a[i][j] == minstr[i] && a[i][j] == maxcol[j]){
- m++;
- }
- }
- }
- cout << m;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement