제출 #386483

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
386483		fadi57	Table Tennis (info1cup20_tabletennis)	C++14	9 / 100	92 ms	2020 KiB

tabletennis

#include<bits/stdc++.h>
using namespace std;
const int mx=2e5+10;
typedef long long ll;
const int inf=1e9+3e5;
int a[mx];
map<int,int>mp;int n,k,z;
bool check(int s){

int l=0;int r=z-1;
int cnt=n/2;
while(l<r){

if(cnt==0){break;}

    if(a[l]+a[r]>s){r--;}
    else if(a[l]+a[r]<s){l++;} else{
            l++;
    r--;
    cnt--;
    }
}
if(cnt==0){return 1;}



}

int main(){
 cin>>n>>k; z=n+k;


 for(int i=0;i<n+k;i++){
    cin>>a[i];
   

 }

 /*
 3 1
 1 1 1 1*/
 int teams=n/2;
 int aa;int bb;
 vector<int>v;
for(int i=0;i<=k;i++){


 for(int j=n-1;j<z;j++){
   v.push_back(a[i]+a[j]);

 }
}
sort(v.begin(),v.end());
int sum;
for(auto it:v){
   if(check(it)){
    sum=it;break;
   }
}//cout<<sum;
int l=0;int r=z-1;
int cnt=n/2;
vector<int>o;
while(l<r){

if(cnt==0){break;}

    if(a[l]+a[r]>sum){r--;}
    else if(a[l]+a[r]<sum){l++;} else{
           // cout<<a[l]<<" "<<a[r]<<" ";
            o.push_back(a[l]); o.push_back(a[r]);
            l++;
    r--;
    cnt--;
    }
}sort(o.begin(),o.end());
for(auto it:o){
        cout<<it<<" ";

}
}

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

tabletennis.cpp: In function 'int main()':
tabletennis.cpp:42:6: warning: unused variable 'teams' [-Wunused-variable]
   42 |  int teams=n/2;
      |      ^~~~~
tabletennis.cpp:43:6: warning: unused variable 'aa' [-Wunused-variable]
   43 |  int aa;int bb;
      |      ^~
tabletennis.cpp:43:13: warning: unused variable 'bb' [-Wunused-variable]
   43 |  int aa;int bb;
      |             ^~
tabletennis.cpp: In function 'bool check(int)':
tabletennis.cpp:27:1: warning: control reaches end of non-void function [-Wreturn-type]
   27 | }
      | ^
tabletennis.cpp: In function 'int main()':
tabletennis.cpp:68:10: warning: 'sum' may be used uninitialized in this function [-Wmaybe-uninitialized]
   68 |     else if(a[l]+a[r]<sum){l++;} else{
      |          ^~

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