제출 #1259188

#제출 시각아이디문제언어결과실행 시간메모리
1259188bynixPoi (IOI09_poi)C++20
100 / 100
389 ms31820 KiB
#include "bits/stdc++.h" using namespace std; #define int long long signed main(){ int n, t, p; cin >> n >> t >> p; vector<vector<int>> d(n, vector<int>(t)); for (int i = 0; i < n; i++) for (int j = 0; j < t; j++) cin >> d[i][j]; vector<int> ts(t, 0); for (int i = 0; i < t; i++) for (int j = 0; j < n; j++) ts[i] += !d[j][i]; vector<vector<int>> c(n, vector<int>(3, 0)); for (int i = 0; i < n; i++) for (int j = 0; j < t; j++) c[i][0] += d[i][j] * ts[j], c[i][1] += d[i][j], c[i][2] = i+1; sort(c.begin(), c.end(), [&](vector<int>& a, vector<int>& b){ if (a[0] != b[0]) return a[0] > b[0]; else if (a[1] != b[1]) return a[1] > b[1]; else return a[2] < b[2]; }); for (int i = 0; i < n; i++) if (c[i][2] == p) cout << c[i][0] << ' ' << i+1; }
#Verdict Execution timeMemoryGrader output
Fetching results...