Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <iomanip>
- #include <algorithm>
- using namespace std;
- int main() {
- double n, m, A[10][10], /*vid[10],*/ sum=0.;
- long long maz, max=-1000001., min=1000001;
- cin>>n>>m;
- for(int i=0; i<n; i++){
- for(int j=0; j<m; j++){
- cin>>A[i][j];
- }
- }
- int vid[10]={};
- for(int i=0; i<n; i++){
- for(int j=0; j<m; j++){
- sum=sum+A[i][j];
- }
- vid[i]=sum/(m*1.);
- //cout<<vid[i]<<endl;
- sum=0;
- }
- for(int i=0; i<n; i++){
- if(min>vid[i])
- maz=i;
- }
- for(int j=0; j<m; j++){
- if(max<=A[maz][j])
- max=A[maz][j];
- }
- cout<<max<<endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement