-
Notifications
You must be signed in to change notification settings - Fork 2
/
marks.cpp
56 lines (44 loc) · 865 Bytes
/
marks.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
#include<bits/stdc++.h>
#include<string.h>
#include<cstdlib>
using namespace std;
int main()
{
int i,j,k;
int n,m;
int count=0;
cin>>n>>m;
char a[n][m],ch[n],max;
int s[n];
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
cin>>a[i][j];
}
s[i]=0;
}
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
ch[j]=a[j][i];
}
sort(ch,ch+n);
max=(ch[n-1]);
for(j=0;j<n;j++)
{
if(a[j][i]==max)
{
s[j]++;
}
}
}
for(i=0;i<n;i++)
{
if(s[i]>0)
count++;
}
cout<<count<<endl;
return 0;
}