AlexNeagu11

rosii mici

Apr 5th, 2024
193
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.17 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3.  
  4. ifstream in("rosii_mici.in");
  5. ofstream out("rosii_mici.out");
  6.  
  7. #define cin in
  8. #define cout out
  9.  
  10.  
  11. int main() {
  12. ios_base::sync_with_stdio(false);
  13. cin.tie(0);
  14.  
  15. int n, m, q;
  16. cin >> n >> m >> q;
  17.  
  18. vector<vector<int>> lines;
  19. for(int i = 0; i < n; ++i) {
  20. vector<int> line;
  21. for(int j = 0; j < m; ++j) {
  22. int x;
  23. cin >> x;
  24. line.push_back(x);
  25. }
  26. sort(line.begin(), line.end());
  27. lines.push_back(line);
  28. }
  29.  
  30. vector<pair<int,int>> queries;
  31. for(int i = 0; i < q; ++i) {
  32. int x;
  33. cin >> x;
  34. queries.push_back(make_pair(x, i));
  35. }
  36.  
  37. sort(queries.begin(), queries.end());
  38. vector<int> ans(q);
  39.  
  40. for(int i = 0; i < n; ++i) {
  41. int L = 0;
  42. for(int j = 0; j < q; ++j) {
  43. int x = queries[j].first, ind = queries[j].second;
  44. while(L < m && lines[i][L] <= x) {
  45. L++;
  46. }
  47. ans[ind] = max(ans[ind], (i + 1) * L);
  48. }
  49. }
  50.  
  51. for(auto it: ans) {
  52. cout << it << '\n';
  53. }
  54. return 0;
  55. }
Advertisement
Add Comment
Please, Sign In to add comment