제출 #384816

#제출 시각아이디문제언어결과실행 시간메모리
384816ritul_kr_singhPoi (IOI09_poi)C++17
100 / 100
350 ms12140 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define sp << ' ' << #define nl << '\n' signed main(){ cin.tie(0)->sync_with_stdio(0); int n, t, p; cin >> n >> t >> p; bool g[n][t]; int points[t]; fill(points, points+t, n); array<int, 3> ranks[n]; for(int i=0; i<n; ++i) for(int j=0; j<t; ++j) cin >> g[i][j], points[j] -= g[i][j]; for(int i=0; i<n; ++i){ int a = 0, b = 0; for(int j=0; j<t; ++j) if(g[i][j]) a += points[j], ++b; ranks[i] = {-a, -b, i}; } sort(ranks, ranks+n); for(int i=0; i<n; ++i){ if(ranks[i][2]==p-1) cout << -ranks[i][0] sp i+1; } }
#Verdict Execution timeMemoryGrader output
Fetching results...