제출 #373240

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
373240		ahmedfouadnew	Table Tennis (info1cup20_tabletennis)	C++17	49 / 100	3068 ms	119960 KiB

tabletennis

#include<bits/stdc++.h>
using namespace std;
#define s second
#define f first
#define pb push_back
//#define int long long
//#define double long double
int n,k;
int a[200005];
unordered_map<int,int>mp;
int mx,mxi;
void fun(int ii,int s,int e)
{
    e=min(e,n+k-1);
    s=max(0,s);
    for(int i=s;i<=e;i++)
    {
        if(i==ii) continue;
        mp[a[ii]+a[i]]++;
        if(mp[a[ii]+a[i]]>mx)
        {
            mx=mp[a[ii]+a[i]];
            mxi=a[ii]+a[i];
        }
    }
}
signed main()
{
  scanf("%d%d",&n,&k);
  for(int i=0;i<n+k;i++)
  {
      scanf("%d",a+i);
  }
  sort(a,a+n+k);
  for(int i=0;i<min(n+k,(n+k)/2+k+k);i++)
  {
      fun(i,(n+k-1-i)-k-1,(n+k-1-i)+k+1);
  }
  vector<int>ans;
  int cnt=n;
  int e=n+k-1;
  for(int i=0;i<n+k;i++)
  {
      int cur=e;
      bool ok=0;
      while(e-cur<=k)
      {
          if(a[i]+a[cur]==mxi)
          {
              ok=1;
              ans.pb(a[i]);
              ans.pb(a[cur]);
              break;
          }
          cur--;
      }
      if(ok)
      {
          cnt-=2;
          e=cur-1;
      }
      if(cnt==0) break;
  }
  sort(ans.begin(),ans.end());
  for(int i=0;i<ans.size();i++)
  {
      if(i) printf(" ");
      printf("%d",ans[i]);
  }
     return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

tabletennis.cpp: In function 'int main()':
tabletennis.cpp:65:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |   for(int i=0;i<ans.size();i++)
      |               ~^~~~~~~~~~~
tabletennis.cpp:29:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   29 |   scanf("%d%d",&n,&k);
      |   ~~~~~^~~~~~~~~~~~~~
tabletennis.cpp:32:12: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   32 |       scanf("%d",a+i);
      |       ~~~~~^~~~~~~~~~

• Subtask 1: 11 / 11
• Subtask 2: 0 / 9
• Subtask 3: 14 / 14
• Subtask 4: 15 / 15
• Subtask 5: 9 / 9
• Subtask 6: 0 / 14
• Subtask 7: 0 / 15
• Subtask 8: 0 / 13