Files
python/TangDou/KaoShi/TangDou_2.cpp
HuangHai 1f397eca87 'commit'
2025-08-30 18:35:01 +08:00

25 lines
523 B
C++

#include <bits/stdc++.h>
using namespace std;
const int N = 110;
int x[N], y[N];
int n;
int maxv, maxp;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) cin >> x[i] >> y[i];
for (int i = 1; i <= n; i++){
int cnt = 0;
for (int j = 1; j <= n; j++)
if (x[i] > x[j] && y[i] > y[j]) cnt++;
if(cnt>=maxv){
maxv = cnt;
maxp = i;
}
cout << cnt;
}
cout << endl;
cout << maxp << endl;
return 0;
}