제출 #743270

#제출 시각아이디문제언어결과실행 시간메모리
743270vjudge1쌀 창고 (IOI11_ricehub)C++17
0 / 100
6 ms1728 KiB
#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
vector<long long> vec;
map<int,int> mp;
int besthub(int R, int L, int X[], long long B)
{
  int ans = 0;
  for(int i=0;i<R;i++) mp[X[i]]++;
  int pos = 0 , maxx = 0;
  for(auto [p,v]:mp) {
    if (v>maxx) {
      maxx = v;
      pos = p;
    }
  }
//  for(int i=max(0, (R/2)-550);i<min(R, (R/2)+550);i++) {
    int now = 0;
    vec.clear();
    for(int j=0;j<R;j++) {
      vec.push_back(abs(X[j] - pos));
    }
    sort(vec.begin(), vec.end());
    long long cou = 0;
    for(auto t:vec) {
      cou += t;
      if (cou>B) break;
      now++;
    }
//    ans = max(ans, now);
//  }
  return now;
}

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

ricehub.cpp: In function 'int besthub(int, int, int*, long long int)':
ricehub.cpp:8:7: warning: unused variable 'ans' [-Wunused-variable]
    8 |   int ans = 0;
      |       ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...