1481B - New Colony - CodeForces Solution


brute force greedy implementation *1100

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>

using namespace std;
 
int main(){
   int t; cin>>t;
   while(t--){
    int n,k; cin>>n>>k;
    vector<int> v;
    for (int i = 0; i < n; i++){
        int m;cin>>m;v.push_back(m);
    }
   int store=-1;
   int check=0;
    for (int i = 0; i < k; i++){
        for(int j=0;j+1<n;j++){
                if(v[j]<v[j+1]){
                    check=0;
                    store=j+1;
                    v[j]++;
                    break;
                }
                check=1;
                store=-1;

        } 
        if(check) break;

          
    }
    cout<<store<<endl;


    
        }
    }   
  


Comments

Submit
0 Comments
More Questions

1692B - All Distinct
1156C - Match Points
1675A - Food for Animals
1328C - Ternary XOR
1689A - Lex String
1708B - Difference of GCDs
863A - Quasi-palindrome
1478A - Nezzar and Colorful Balls
1581B - Diameter of Graph
404A - Valera and X
908A - New Year and Counting Cards
146A - Lucky Ticket
1594C - Make Them Equal
1676A - Lucky
1700B - Palindromic Numbers
702C - Cellular Network
1672C - Unequal Array
1706C - Qpwoeirut And The City
1697A - Parkway Walk
1505B - DMCA
478B - Random Teams
1705C - Mark and His Unfinished Essay
1401C - Mere Array
1613B - Absent Remainder
1536B - Prinzessin der Verurteilung
1699B - Almost Ternary Matrix
1545A - AquaMoon and Strange Sort
538B - Quasi Binary
424A - Squats
1703A - YES or YES