oj.uz

답안 #1087075

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1087075 2024-09-12T07:35:02 Z toast12 Med (COCI22_med) C++14
50 / 50
 16 ms 472 KB 
#include <bits/stdc++.h>
using namespace std;

vector<string> names;
vector<int> score;

bool compare(int a, int b) {
    return (score[a] == score[b] ? names[a] < names[b] : score[a] > score[b]);
}

int main() {
    int n;
    cin >> n;
    names.resize(n);
    score.resize(n);
    for (int i = 0; i < n; i++) {
        cin >> names[i];
        for (int j = 0; j < 5; j++) {
            int x;
            cin >> x;
            score[i] += x;
        }
    }
    vector<int> idx;
    for (int i = 0; i < n; i++) idx.push_back(i);
    for (int i = 0; i < n; i++) {
        score[i] += 500;
        sort(idx.begin(), idx.end(), compare);
        for (int j = 0; j < n; j++) {
            if (idx[j] == i) {
                cout << j+1 << ' ';
                break;
            }
        }
        score[i] -= 1000;
        sort(idx.begin(), idx.end(), compare);
        for (int j = 0; j < n; j++) {
            if (idx[j] == i) {
                cout << j+1 << ' ';
                break;
            }
        }
        cout << '\n';
        score[i] += 500;
    }
    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 436 KB Output is correct
4 Correct 0 ms 348 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 436 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 5 ms 348 KB Output is correct
6 Correct 10 ms 468 KB Output is correct
7 Correct 6 ms 348 KB Output is correct
8 Correct 16 ms 472 KB Output is correct
9 Correct 3 ms 348 KB Output is correct