caozy623's Blog

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<queue>
#include<stack>
#include<map>
#include<cmath>
#include<cstdlib>
#define ll long long
#define maxn 100010
#define inf 1000000000
#define linf (1LL<<50)
using namespace std;
#define REP( i, n ) for ( int i = 1; i <= n; i ++ )
#define REP_0( i, n ) for ( int i = 0; i < n; i ++ )
#define REP_0N( i, n ) for ( int i = 0; i <= n; i ++ )
#define REP_S( i, ss ) for ( char *i = ss; *i; i ++ )
#define REP_G( i, u ) for ( int i = pos[ u ]; i; i = g[ i ].frt )
#define FOR( i, a, b ) for ( int i = a; i <= b; i ++ )
#define DWN( i, a, b ) for ( int i = b; i >= a; i -- )
#define RST( a ) memset ( a, 0, sizeof ( a ) )
#define CLR( a, x ) memset ( a, x, sizeof ( a ) )
#define CPY( a, b ) memcpy ( a, b, sizeof ( a ) )
inline ll read()
{
    ll x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x*=10;x+=ch-'0';ch=getchar();}
    return x*f;
}

inline void read(char *s,int &ts)
{
char x=getchar();
while(!(x>='a'&&x<='z'))x=getchar();
while(x>='a'&&x<='z')s[++ts]=x,x=getchar();
}
int n,k;
int a[maxn],b[maxn],c[maxn];
int ans1=inf,ans2;
int mx,mn;
int t1,t2;
int flag;
int main()
{
    scanf("%d%d",&n,&k);
    for(int i=1;i<=n;i++)
    scanf("%d",&a[i]);
    for(int i=1;i<=k;i++)
    {
        mx=-1;
        mn=inf;
        for(int j=1;j<=n;j++)
        {
            if(a[j]>mx) {mx=a[j];t1=j;}
            if(a[j]<mn) {mn=a[j];t2=j;}
        }
        //printf("%d %d\n",mx,mn);
        if(mx-mn<=1) {ans2=i-1;flag=1;ans1=min(ans1,mx-mn);break;}
        ans1=min(ans1,mx-mn);
        b[i]=t1;c[i]=t2;
        a[t1]--;a[t2]++;
    }
    if(!flag) 
    ans2=k;
    mx=-1;mn=inf;
    for(int j=1;j<=n;j++)
    {
        if(a[j]>mx) {mx=a[j];t1=j;}
        if(a[j]<mn) {mn=a[j];t2=j;}
    }
    ans1=min(ans1,mx-mn);
    printf("%d %d\n",ans1,ans2);
    for(int i=1;i<=ans2;i++)
    printf("%d %d\n",b[i],c[i]);
    return 0;
}