제출 #467669

#제출 시각아이디문제언어결과실행 시간메모리
467669jam_xd_쌀 창고 (IOI11_ricehub)C++17
42 / 100
1093 ms648 KiB
#include "ricehub.h" #include <bits/stdc++.h> using namespace std; //si solo era esto me muero >:v. int besthub(int R, int L, int X[], long long B) { int suma_d=0, campos=0; int jamon=0;//auxiliar for(int i=0;i<R;i++){ deque<long long>diferencias(R); for(int j=0;j<R;j++)diferencias[j] = abs(X[i]-X[j]); sort(diferencias.begin(), diferencias.end()); for(int k=0;k<diferencias.size();k++){ if(suma_d + diferencias[k] <= B){ suma_d += diferencias[k]; campos++; }else break; } int maximo = max(jamon, campos); jamon = maximo; suma_d=0; campos=0; } return jamon; }

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

ricehub.cpp: In function 'int besthub(int, int, int*, long long int)':
ricehub.cpp:19:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |   for(int k=0;k<diferencias.size();k++){
      |               ~^~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...