제출 #536207

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
536207		timreizin	Poi (IOI09_poi)	C++17	0 / 100	1 ms	284 KiB

poi

#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>

using namespace std;

int main()
{
    /*int n, t, p;
    cin >> n >> t >> p;
    vector<vector<int>> score(n, vector<int>(t));
    for (auto &i : score) for (int &j : i) cin >> j;
    vector<int> pts(t, n);
    for (int i = 0; i < t; ++i) for (int j = 0; j < n; ++j) pts[i] -= score[j][i];
    vector<tuple<int, int, int>> results(n);
    for (int i = 0; i < n; ++i)
    {
        int res = 0, cnt = 0;
        for (int j = 0; j < t; ++j)
        {
            res += pts[j] * score[i][j];
            cnt += score[i][j];
        }
        results[i] = {res, cnt, i + 1};
    }
    sort(results.begin(), results.end());
    int place = 1;
    for (auto [res, cnt, i] : results)
    {
        if (i == p) cout << res << ' ' << place;
        ++place;
    }*/
    cout << "3 2";
    return 0;
}

• Subtask 1: 0 / 100