Advertisement
Guest User

POI

a guest
Jun 18th, 2019
78
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.79 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2.  
  3. using namespace std;
  4.  
  5. const int MAXN = 2005;
  6.  
  7. int n, t, p;
  8. bool a[MAXN][MAXN];
  9. int val[MAXN], score[MAXN], cnt[MAXN];
  10. vector < pair <int, pair <int, int> > > v;
  11.  
  12. int main () {
  13. cin >> n >> t >> p;
  14. for (int i=1; i<=n; i++) {
  15. for (int j=1; j<=t; j++) {
  16. cin >> a[i][j];
  17. if (a[i][j] == 0) val[j]++; else cnt[i]++;
  18. }
  19. }
  20. for (int i=1; i<=n; i++) {
  21. for (int j=1; j<=t; j++) {
  22. score[i] += a[i][j] * val[j];
  23. }
  24. v.push_back({-score[i], {-cnt[i], i}});
  25. }
  26. sort(v.begin(), v.end());
  27. cout << score[p] << " ";
  28. for (int i=0; i<v.size(); i++) {
  29. if (v[i].second.second == p) {
  30. cout << i+1;
  31. break;
  32. }
  33. }
  34. return 0;
  35. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement