1 条题解
-
0
#include <iostream> #include <vector> using namespace std; struct Point { int x, y; int id; }; int main() { int n; cin >> n; vector<Point> points(n); // 读取点的坐标并设置编号 for (int i = 0; i < n; ++i) { cin >> points[i].x >> points[i].y; points[i].id = i + 1; // 编号从1开始 } vector<int> power(n, 0); // 计算每个点的战斗力 for (int i = 0; i < n; ++i) { int cnt = 0; for (int j = 0; j < n; ++j) { if (points[j].x < points[i].x && points[j].y < points[i].y) { cnt++; } } power[i] = cnt; } // 输出每个点的战斗力 for (int i = 0; i < n; ++i) { cout << power[i] << endl; } // 找出战斗力最高的点的最大编号 int max_power = -1; int max_id = -1; for (int i = 0; i < n; ++i) { if (power[i] > max_power) { max_power = power[i]; max_id = points[i].id; } else if (power[i] == max_power && points[i].id > max_id) { max_id = points[i].id; } } cout << max_id << endl; return 0; }
- 1
信息
- ID
- 484
- 时间
- 1000ms
- 内存
- 64MiB
- 难度
- 10
- 标签
- 递交数
- 2
- 已通过
- 1
- 上传者