Submission #28807

#	Time	Username	Problem	Language	Result	Execution time	Memory
28807		ozaslan	쌀 창고 (IOI11_ricehub)	C++14	17 / 100	1000 ms	6080 KiB

ricehub

#include "ricehub.h"
#include<bits/stdc++.h>

#include "ricehub.h"
#include <stdio.h>
#include <stdlib.h>

#define MAX_R  1000000

using namespace std;

/*
static int R, L;
static long long B;
static int X[MAX_R];
static int solution;

inline
void my_assert(int e) {if (!e) abort();}

static void read_input()
{
  int i;
  my_assert(3==scanf("%d %d %lld",&R,&L,&B));
  for(i=0; i<R; i++)
    my_assert(1==scanf("%d",&X[i]));
  my_assert(1==scanf("%d",&solution));
}

int main()
{
    freopen("grader.in.1", "r", stdin);
  int ans;
  read_input();
  ans = besthub(R,L,X,B);
  if(ans==solution)
    printf("Correct.\n");
  else
    printf("Incorrect.  Returned %d instead of %d.\n",ans,solution);

  return 0;
}*/

int besthub(int R, int L, int X[], long long B)
{
	int enIyi = 0;
	vector<int> uzak(R);

	for (int i = 0; i <= L; i++) {
		for (int j = 0; j < R; j++)
			uzak[j] = abs(i - X[j]);

		sort(uzak.begin(), uzak.end());

		long long toplam = 0;
		int k;
		for (k = 0; k < R && toplam <= B; k++)
			toplam += uzak[k];

		enIyi = max(enIyi, k-1);
	}

	return enIyi;
}

• Subtask 1: 17 / 17
• Subtask 2: 0 / 25
• Subtask 3: 0 / 26
• Subtask 4: 0 / 32