codeforces237A

就是找相同时间的最大个数

 

#include <iostream>//#include <cstdlib>using namespace std;int n, a, b, array[100][100], l;int main ( ) {    cin >> n;    for ( int i = 1; i <= n; ++i ) {        cin >> a >> b;        array[a][b]++;        if ( array[a][b] > l ) l = array[a][b];    }    cout << l << endl;    //system ( "pause" );}