Submission #841044

#TimeUsernameProblemLanguageResultExecution timeMemory
841044Muhammad_AneeqA Plus B (IOI23_aplusb)C++17
30 / 100
6 ms288 KiB
#include <vector>
#include <algorithm>
#include "aplusb.h"
using namespace std;
vector<int> smallest_sums(int n,vector<int> a ,vector<int> b)
{
  long long st=0,en=2e9+10;
  while (st+1<en)
  {
    int mid=(st+en)/2;
    int k=n;
    for (int i=0;i<n&&k;i++)
    {
      for (int j=0;j<n&&k;j++)
      {
        if (a[i]+b[j]<=mid)
          k--;
      }
    }
    if (k==0)
      en=mid;
      else
      st=mid;  
  }
  vector<int>ans(n);
  int k=0;
  for (int i=0;i<n&&k<n;i++)
    {
      for (int j=0;j<n&&k<n;j++)
      {
        if (a[i]+b[j]<=en)
        {
          ans[k++]=a[i]+b[j];
        }
      }
    }
    sort(ans.begin(), ans.end());
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...