Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // Tim gia tri lon thu 2 trong mang
- // Khai bao ham thu vien neu co
- #include<stdio.h>
- #include<conio.h>
- #define SIZE 100
- void nhap(int a[][SIZE],int &m,int &n)
- {
- scanf("%d%d",&m,&n);
- for(int i=0;i<m;i++)
- {
- for(int j=0;j<n;j++)
- {
- scanf("%d",&a[i][j]);
- }
- }
- }
- int max2mang(int a[][SIZE],int m,int n)
- {
- int max=a[0][0];
- for(int i=0;i<m;i++)
- {
- for(int j=0;j<n;j++)
- {
- if((a[i][j])>max)
- max=a[i][j];
- }
- }
- int max2=a[0][0];
- for(i=0;i<m;i++)
- {
- for(int j=0;j<n;j++)
- {
- if((a[i][j])!=max &&max2<max && max2<a[i][j])
- max2=a[i][j];
- }
- }
- return max2;
- }
- void main()
- {
- int a[SIZE][SIZE],m,n;
- nhap(a,m,n);
- printf("%d",max2mang(a,m,n));
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement