Submission #1863079

---

Source Code Expand

#include<stdio.h>
 
int main()
{
  long int N=0,K=0,i,j=0,k=0,count=0,MAXin=0,set=0,sum=0;
  scanf("%ld %ld", &N,&K);
  long A[N];
  long MAX[N];
  long Serect[N];
  for(i=0;i<N;i++){
    MAX[i]=0;
    Serect[i]=0;
  }
  for (i=0;i<N;i++){
    scanf("%ld", &A[i-count]);
    k= i-count;
    for(j=0;j<i-count;j++){
      if(A[j] == A[i-count]){
        count++;
        k=j;
      }
    }
    MAX[k]++;
  } 
  
  for(j=0;j<K;j++){
//    printf("a\n");
    MAXin = MAX[N-1];
    for(i=0;i<N;i++){
//      printf("  %ld %ld",MAX[i],MAXin);
      if(MAX[i]>MAXin && Serect[i]==0){
        MAXin = MAX[i];
        set=i;
//        printf("%ld\n",set);
      }
    }
    Serect[set]++;
  }
  
  for(i=0;i<N;i++){
    if(Serect[i]==0){
      sum=sum+MAX[i];
    }
  }
/*
  printf("%ld %ld %ld %ld\n",K,i,count,sum);
  for(i=0;i<N;i++){
  printf(" %ld",MAX[i]);
  printf(" %ld\n",Serect[i]);
  }
*/
    printf("%ld",sum);
  return 0;
}

Submission Info

Judge Result