Codeforces Round #345 (Div. 2) B. Beautiful Paintings __ greedy and Bucket_sort

#include 
#include 
#include 
using namespace std;
const int maxn = 1000 + 8;
bool Bucket_sort[maxn][maxn];


int main()
{
    memset(Bucket_sort, false, sizeof Bucket_sort);
    int n, a, ans = 0;
    scanf("%d", &n);
    //WA13  1 <= ai <= 1000 so i = 1 to 1000  ,  not the first time I did i = 0 to 999
    while(n--){
        scanf("%d", &a);
        for(int i = 1; i <= 1000; i++)
            if(!Bucket_sort[i][a]) {Bucket_sort[i][a] = true; break;}
    }
    int pairnum;
    for(int i = 1; i <= 1000; i++){
        pairnum = 0;
        for(int j = 1; j <= 1000; j++){
            if(Bucket_sort[i][j]) pairnum++;
        }
        //cout<<pairnum<<endl; if(pairnum > 1)ans += pairnum - 1;     //we need to add this "if(pairnum > 1)"
    }
    printf("%d", ans);
    return 0;
}

非特殊说明，本博所有文章均为博主原创，未经许可不得转载。

https://www.prolightsfxjh.com/

Thank you!

                                                                                                                                             ------from ProLightsfx