제출 #366012

#제출 시각아이디문제언어결과실행 시간메모리
366012keta_tsimakuridzeTable Tennis (info1cup20_tabletennis)C++14
0 / 100
63 ms1004 KiB
#include<bits/stdc++.h> #define f first #define s second using namespace std; const int N=2e5+5,mod=1e9+7; int t,n,k,F; vector<int >v,ans; int a[N]; int main(){ cin>>n>>k; for(int i=1;i<=n+k;i++){ cin>>a[i]; } for(int f=0;f<=k;f++){ for(int s=0;s<=k-f;s++){ int lft=k-s-f; v.clear(); int l=f+1; int r=n+k-s; int sum=a[l]+a[r]; while(l<r) { if(a[l]+a[r]==sum) v.push_back(a[l]),v.push_back(a[r]),l++,r--; else if(a[l]+a[r]>sum) r--,lft--; else l++,lft--; if(!lft) break; } if(v.size()>=n) { for(int i=0;i<n;i++){ ans.push_back(v[i]); } sort(ans.begin(),ans.end()); for(int i=0;i<n;i++){ cout<<ans[i]<<" "; } F=1; return 0; } } } return 0; }

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

tabletennis.cpp: In function 'int main()':
tabletennis.cpp:27:15: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   27 |    if(v.size()>=n) {
      |       ~~~~~~~~^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...