Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #define _USE_MATH_DEFINES
- #include <string>
- #include <algorithm>
- #include <cmath>
- #include <iomanip>
- #include <fstream>
- #include <deque>
- #include <vector>
- #include <stdlib.h>
- #include <set>
- #include <iostream>
- using namespace std;
- int main() {
- ifstream in("input.txt");
- ofstream out("output.TXT");
- int mas[750][750];
- vector <int> vecmin;
- vector <int> vecmax;
- int n, m,count = 0;
- in >> n >> m;
- for (int i = 0; i < n; i++) {
- vecmin.push_back(1001);
- }
- for (int i = 0; i < m; i++) {
- vecmax.push_back(-1001);
- }
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < m; j++) {
- in >> mas[i][j];
- vecmin[i] = (min(vecmin[i], mas[i][j]));
- vecmax[j] = (max(vecmax[j], mas[i][j]));
- }
- }
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < m; j++) {
- if (mas[i][j] == vecmin[i] && mas[i][j] == vecmax[j]) {
- count++;
- }
- }
- }
- out << count;
- in.close();
- out.close();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement