33 lines
811 B
C++
33 lines
811 B
C++
#include <bits/stdc++.h>
|
|
#include <iostream>
|
|
using namespace std;
|
|
|
|
int returnVecMax(vector<int> a) {
|
|
int max = a[0];
|
|
int index = 0;
|
|
for (int i =1; i < a.size(); i++) {
|
|
if (a[i] > max) {
|
|
max = a[i];
|
|
index = i;
|
|
}
|
|
}
|
|
return index;
|
|
}
|
|
|
|
int main () {
|
|
int o, n, m, t, h;
|
|
cin >> o >> n >> m >> t >> h; //orak szama, tantargyak szama, egy sorszama, egy nap sorszama
|
|
int ts, tts, nap, ora; // tanar sorszam, tanitott tantargy sorszam, nap, ora
|
|
|
|
vector<int> tantargyElofordulas(n);
|
|
|
|
for (int i = 0; i < o; i++) {
|
|
cin >> ts >>tts>>nap>>ora;
|
|
tantargyElofordulas[ts] += 1;
|
|
|
|
}
|
|
// for (int i = 0; i < tantargyElofordulas.size(); i++) {
|
|
// cout<<tantargyElofordulas[i]<<endl;
|
|
// }
|
|
cout<<returnVecMax(tantargyElofordulas) + 1;
|
|
} |