Submission #655211

#TimeUsernameProblemLanguageResultExecution timeMemory
655211AntonisPapaevRice Hub (IOI11_ricehub)C++17
42 / 100
1084 ms852 KiB
#include<iostream>
#include<cmath>
#include<algorithm>
#include<utility>
#include<vector>
#include "ricehub.h"

int besthub(int R, int L, int X[], long long B)
{
    std::pair<long long,long long> ans{0,-1};
    std::vector<long long> p;
for(int i=0;i<L;i++) {
        p.clear();
    long long cnt=0,check=0;
        for (int j=0;j<R;j++)
        p.push_back(abs(i-X[j]));

        std::sort(p.begin(),p.end());

        for (int k=0;k<p.size();k++)
        if (check+p[k]<=B) {
        check+=p[k];
        cnt++; }
        else
            break;

        if (cnt>=ans.first)
            ans={cnt,i};
}
  return ans.first;
}

Compilation message (stderr)

ricehub.cpp: In function 'int besthub(int, int, int*, long long int)':
ricehub.cpp:20:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |         for (int k=0;k<p.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...