0分求助QWQ
查看原帖
0分求助QWQ
907233
一只小菜包楼主2024/7/8 11:16
struct ziliao {
    int id;
    int fs;
};

ziliao mian[5000];

bool cmp(ziliao x, ziliao y) {
    if (x.fs != y.fs) return x.fs > y.fs;
    return x.id < y.id;
}

int main() {
    int n, m, losser_id, ans = 0;
    cin >> n >> m;
    for (int i = 0; i < n; i++) {
        cin >> mian[i].id >> mian[i].fs;
    }
    sort(mian, mian + n, cmp);
    losser_id = mian[m * 3 / 2 - 1].id;
    for (int i = 0; i < n; i++) {
        if (mian[i].id >= losser_id) ans++;
    }
    cout << mian[m * 3 / 2 - 1].fs << " " << ans << endl;
    for (int i = 0; i < n; i++) {
        if (mian[i].id >= losser_id) {
            cout << mian[i].id << "   " << mian[i].fs << endl;
        }
    }
    return 0;
}

不知道怎么改QWQ,在线等。

2024/7/8 11:16
加载中...