제출 #1188325

#제출 시각아이디문제언어결과실행 시간메모리
1188325petezaPoi (IOI09_poi)C++20
100 / 100
149 ms16168 KiB
#include <bits/stdc++.h> using namespace std; int n, m, p; int score[2005]; int psd[2005][2005]; vector<tuple<int, int, int>> tup; int main() { cin.tie(0) -> sync_with_stdio(0); cin >> n >> m >> p; for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++) cin >> psd[i][j]; } for(int j=1;j<=m;j++) { int cnt = n; for(int i=1;i<=n;i++) { cnt -= psd[i][j]; } score[j] = cnt; } for(int i=1;i<=n;i++) { int cnt = 0, totsc = 0; for(int j=1;j<=m;j++) { cnt += psd[i][j]; totsc += psd[i][j] * score[j]; } tup.emplace_back(totsc, cnt, -i); } sort(tup.rbegin(), tup.rend()); int i=1; for(auto &e:tup) { if(get<2>(e) == -p) { cout << get<0>(e) << ' ' << i; break; } i++; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...