제출 #598468

#제출 시각아이디문제언어결과실행 시간메모리
598468Trisanu_DasPoi (IOI09_poi)C++17
100 / 100
233 ms16084 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; int main() { ios::sync_with_stdio(0); cin.tie(0); int n, t, p; cin >> n >> t >> p; vector<int> solves(t + 1,0); vector<vector<int> > v(n + 1,vector(t + 1,int(0))); for(int i = 1;i <= n;i++){ for(int j = 1;j <= t;j++) { cin >> v[i][j]; solves[j]+=v[i][j]; } } vector<array<int,3>> stats(n); vector<int> cnt(n + 1,0); vector<int> sum(n + 1,0); for(int i = 1;i <= n;i++) { for(int j = 1;j <= t;j++) { cnt[i] += v[i][j]; sum[i] += v[i][j]*(n-solves[j]); } stats[i-1] = {-sum[i],-cnt[i],i}; } sort(stats.begin(), stats.end()); for(int i = 0;i < n;i++) if(stats[i][2] == p) cout << -stats[i][0] << ' ' << i + 1 << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...