蓝桥杯省模拟赛第十题（淹没城堡）

#define H 100005
long long tong[H] = {0};        
for(int i = 1;i <= n*m;i++){
    cin >> tmp;
    tmp = tmp>H?H:tmp;      //对于叠加高过最高水位的，直接让它高度=水位最高高度
    cin >> tong[i];
}

for(int i = h;i > 0;i--){
    hs[i] = tong[i]+fugai;
    fugai+=tong[i];
}

#include<iostream>
#include<cstdio>
#define H 100001

using namespace std;

int tong[100005];           //高度为下标的方块列数 
long long hs[100005];       //每层淹没数量 
long long leijia[100005];   //高度大于下标的水位额外淹没数量 
int fugai;                  //高度大于当前h的列数         
int main(){
    int n,m,h,tmp;
    cin >> n >> m;
    for(int i = 0;i < n*m;i++){
        cin >> tmp;
        if(tmp>H){
            tmp = H;
        }
        tong[tmp]++;
    }
    cin >> h;
    for(int i = h+1;i <= H;i++){
        fugai+=tong[i];
    }
    for(int i = h;i > 0;i--){
        hs[i] = tong[i]+fugai;
        leijia[i] = tong[i]+fugai;
        fugai+=tong[i];
    }
    for(int i = 1;i <= h;i++){
        leijia[i] += leijia[i-1];
        hs[i] += leijia[i-1];
        cout << hs[i]<< endl;
    }

    return 0;
}